|
| |
|
|
A035612
|
|
Horizontal para-Fibonacci sequence: says which column of Wythoff array (starting column count at 1) contains n.
|
|
1
| |
|
|
1, 2, 3, 1, 4, 1, 2, 5, 1, 2, 3, 1, 6, 1, 2, 3, 1, 4, 1, 2, 7, 1, 2, 3, 1, 4, 1, 2, 5, 1, 2, 3, 1, 8, 1, 2, 3, 1, 4, 1, 2, 5, 1, 2, 3, 1, 6, 1, 2, 3, 1, 4, 1, 2, 9, 1, 2, 3, 1, 4, 1, 2, 5, 1, 2, 3, 1, 6, 1, 2, 3, 1, 4, 1, 2, 7, 1, 2, 3, 1, 4, 1, 2, 5, 1, 2, 3, 1, 10, 1, 2, 3, 1, 4, 1, 2, 5, 1, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
LINKS
| N. J. A. Sloane, My favorite integer sequences, in Sequences and their Applications (Proceedings of SETA '98).
N. J. A. Sloane, Classic Sequences
|
|
|
FORMULA
| The segment between the first M and the first M+1 is given by the segment before the first M-1.
a(n) = v2(A022340(n)), where v2(n) = A007814(n), the dyadic valuation of n. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Jun 20 2004. In other words, a(n) = A007814(A003714(n)) + 1, which is certainly true - Don Reble, Nov 12 2005.
|
|
|
EXAMPLE
| After the first 6 we see "1 2 3 1 4 1 2" then 7.
|
|
|
CROSSREFS
| Cf. A019586, A035513, A035614.
Sequence in context: A055445 A135560 A138967 * A199539 A089555 A098554
Adjacent sequences: A035609 A035610 A035611 * A035613 A035614 A035615
|
|
|
KEYWORD
| nonn,nice,easy
|
|
|
AUTHOR
| J. H. Conway, N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
