Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098862
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098862 a(n) = column number of Stolarsky array that contains n. +0
2
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; listen)
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

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.

Adjacent sequences: A098859 A098860 A098861 this_sequence A098863 A098864 A098865

Sequence in context: A054372 A070679 A127374 this_sequence A003988 A074650 A002187

KEYWORD

nonn

AUTHOR

Casey Mongoven (cm(AT)caseymongoven.com), Oct 12 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified May 17 13:36 EDT 2008. Contains 139908 sequences.


AT&T Labs Research