|
|
A098861
|
|
a(n) = row number in Stolarsky array that contains n. If the first occurrence of a number in the sequence is deleted, the sequence remains unchanged.
|
|
2
|
|
|
0, 0, 0, 1, 0, 1, 2, 0, 3, 1, 2, 4, 0, 5, 3, 1, 6, 2, 4, 7, 0, 8, 5, 3, 9, 1, 10, 6, 2, 11, 4, 7, 12, 0, 13, 8, 5, 14, 3, 9, 15, 1, 16, 10, 6, 17, 2, 18, 11, 4, 19, 7, 12, 20, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,7
|
|
COMMENTS
|
The Stolarsky array is given in A035506: row 0 are the positive Fibonacci numbers; row 1 (resp. 3) are twice (resp. 3 times) these numbers, starting with 4 (resp. 9); row 2 starts 7,11,18,... etc. - M. F. Hasler, Nov 05 2014
|
|
REFERENCES
|
D. R. Morrison, A Stolarsky Array of Wythoff Pairs, A Collection of Manuscripts Related to the Fibonacci Sequence, edited by V. E. Hoggatt Jr., M. Bicknell-Johnson, published by The Fibonacci Association, (1980) pp. 134-136.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|