Eight hateful sequences

  title={Eight hateful sequences},
  author={N. J. A. Sloane},
  journal={arXiv: Combinatorics},
  • 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… 

The Curling Number Conjecture

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

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

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



Seven Staggering Sequences

When my "Handbook of Integer Sequences" came out in 1973, Philip Morrison gave it an enthusiastic review in the Scientific American and Martin Gardner was kind enough to say in his Mathematical Games

The On-Line Encyclopedia of Integer Sequences

  • N. Sloane
  • Computer Science
    Electron. J. Comb.
  • 1994
The On-Line Encyclopedia of Integer Sequences (or OEIS) is a database of some 130000 number sequences which serves as a dictionary, to tell the user what is known about a particular sequence and is widely used.

An Elementary Problem Equivalent to the Riemann Hypothesis

The function a (n) = dInd is the sum-of-divisors function, so for example a (6) = 12. The number Hn is called the nth harmonic number by Knuth, Graham, and Patashnik [12, sect. 6.3], who detail

Mathematical constants

  • S. Finch
  • Mathematics
    Encyclopedia of mathematics and its applications
  • 2005
UCBL-20418 This collection of mathematical data consists of two tables of decimal constants arranged according to size rather than function, a third table of integers from 1 to 1000, giving some of

The shortest path through many points

ABSTRACT We prove that the length of the shortest closed path through n points in a bounded plane region of area v is ‘almost always’ asymptotically proportional to √(nv) for large n; and we extend

A Slow-Growing Sequence Defined by an Unusual Recurrence

The sequence starts with a(1) = 1; to extend it one writes the sequence so far as XY k , where X and Y are strings of integers, Y is nonempty and k is as large as

The EKG Sequence

It is proved that {a(n) : n ≥ 1) is a permutation of the natural numbers and that c 1 n ≤ a( n) ≤ c 2 n for constants c 1,c 2.

The Traveling Salesman Problem: A Computational Study

Open Library features a library with books from the Internet Archive and lists them in the open library and gives you access to over 1 million free e-Books and the ability to search using subject, title and author.

Homage to a pied puzzler; see chapter seven, Staggering sequences

  • 2009

On the Irregularity of the Duplication Closure