This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A098862 a(n) = column number of Stolarsky array that contains n. 3
 0, 1, 2, 0, 3, 1, 0, 4, 0, 2, 1, 0, 5, 0, 1, 3, 0, 2, 1, 0, 6, 0, 1, 2, 0, 4, 0, 1, 3, 0, 2, 1, 0, 7, 0, 1, 2, 0, 3, 1, 0, 5, 0, 1, 2, 0, 4, 0, 1, 3, 0, 2, 1, 0, 8, 0, 1, 2, 0, 3, 1, 0, 4, 0, 2, 1, 0, 6, 0, 1, 2, 0, 3, 1, 0, 5, 0, 1, 2, 0, 4, 0, 1, 3, 0, 2, 1, 0, 9 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 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. FORMULA The segment between the first x and the first x+1 is given by the segment before the first x-1. CROSSREFS Cf. A035614, A019586, A098862. Sequence in context: A176919 A220645 A127374 * A003988 A185914 A144257 Adjacent sequences:  A098859 A098860 A098861 * A098863 A098864 A098865 KEYWORD nonn AUTHOR Casey Mongoven, Oct 12 2004 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 October 19 22:00 EDT 2018. Contains 316378 sequences. (Running on oeis4.)