cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

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.

Original entry on oeis.org

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
Offset: 1

Views

Author

Casey Mongoven, Oct 12 2004; corrected May 02 2005

Keywords

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.

Crossrefs

A195164 a(n) = column number of Stolarsky array that contains n with column count beginning at 1.

Original entry on oeis.org

1, 2, 3, 1, 4, 2, 1, 5, 1, 3, 2, 1, 6, 1, 2, 4, 1, 3, 2, 1, 7, 1, 2, 3, 1, 5, 1, 2, 4, 1, 3, 2, 1, 8, 1, 2, 3, 1, 4, 2, 1, 6, 1, 2, 3, 1, 5, 1, 2, 4, 1, 3, 2, 1, 9, 1, 2, 3, 1, 4, 2, 1, 5, 1, 3, 2, 1, 7, 1, 2, 3, 1, 4, 2, 1, 6, 1, 2, 3, 1, 5, 1, 2, 4, 1, 3
Offset: 1

Views

Author

Casey Mongoven, Sep 10 2011

Keywords

Crossrefs

Cf. A098862.

Formula

a(n) = A098862(n)+1.
Showing 1-2 of 2 results.