This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 Ron Knott, General Fibonacci Series Casey Mongoven, Sonification of multiple Fibonacci-related sequences, Annales Mathematicae et Informaticae, 41 (2013) pp. 175-192. CROSSREFS Cf. A019586, A035614, A098862. Sequence in context: A071492 A259598 A096067 * A177878 A125940 A071504 Adjacent sequences:  A098858 A098859 A098860 * A098862 A098863 A098864 KEYWORD nonn AUTHOR Casey Mongoven, Oct 12 2004; corrected May 02 2005 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 17 05:27 EDT 2018. Contains 313810 sequences. (Running on oeis4.)