# Eight hateful sequences

```@article{Sloane2008EightHS,
title={Eight hateful sequences},
author={N. J. A. Sloane},
journal={arXiv: Combinatorics},
year={2008}
}```
• N. Sloane
• Published 14 May 2008
• Art
• arXiv: Combinatorics
In his July 1974 Scientific American column, Martin Gardner mentioned the Handbook of Integer Sequences, which then contained 2372 sequences. Today the On-Line Encyclopedia of Integer Sequences (the OEIS) contains 140000 sequences. This paper discusses eight of them, suggested by the theme of the Eighth Gathering For Gardner: they are all infinite, and all 'ateful in one way or another. Each one is connected with an unsolved problem. The sequences are related to: hateful numbers, Angelini's…
4 Citations

### The Curling Number Conjecture

• Mathematics
• 2009
Given a finite nonempty sequence of integers S, by grouping adjacent terms it is always possible to write it, possibly in many ways, as S = X Y^k, where X and Y are sequences and Y is nonempty.

### On the Curling Number of Certain Graphs

• Mathematics
• 2015
In this paper, we introduce the concept of curling subsequence of simple, finite and connected graphs. A curling subsequence is a maximal subsequence \$C\$ of the degree sequence of a simple connected

### Some New Results on the Curling Number of Graphs

• Mathematics
• 2015
Let \$S=S_1S_2S_3\ldots S_n\$ be a finite string. Write \$S\$ in the form \$XYY\ldots Y=XY^k\$, consisting of a prefix \$X\$ (which may be empty), followed by \$k\$ copies of a non-empty string \$Y\$. Then, the

### Errata and Addenda to Mathematical Constants

We humbly and briefly offer corrections and supplements to Mathematical Constants (2003) and Mathematical Constants II (2019), both published by Cambridge University Press. Comments are always