A192852 Lexicographically earliest sequence such that a(n+1+a(n)) = n - a(n).

0, 1, 1, 1, 2, 3, 1, 3, 6, 3, 1, 5, 10, 7, 1, 3, 14, 7, 1, 13, 18, 7, 1, 3, 22, 11, 1, 21, 26, 15, 1, 3, 30, 7, 1, 29, 34, 15, 1, 3, 38, 27, 1, 37, 42, 15, 1, 3, 46, 7, 1, 45, 50, 23, 1, 3, 54, 43

Offset

1,5

Comments

Eric Angelini calls this "A seed and a jumping bean": The value of a(n) indicates over how many terms to the left one jumps, starting at index n, to reach the place which is to filled such that the two values sum up to n.

Links

Table of n, a(n) for n=1..58.

E. Angelini, A seed and a jumping bean, Oct. 2011

E. Angelini, A seed and a jumping bean [Cached copy, with permission]

Crossrefs

Sequence in context: A020501 A283878 A086404 * A152976 A153861 A118981

Adjacent sequences: A192849 A192850 A192851 * A192853 A192854 A192855

Keyword

nonn

Author

M. F. Hasler, according to the original idea of Eric Angelini, Oct 11 2011

Status

approved