login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A083398 Number of diagonals needed to produce a list {1,..n} in the Wythoff array. 0
1, 2, 3, 3, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 8, 8, 8, 9, 9 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..23.

Eric Weisstein's World of Mathematics, Wythoff Array

Clark Kimberling, Interspersions

EXAMPLE

The Wythoff array begins:

1 2 3 5 8

4 7 11 18 29

6 10 16 26 42

The first diagonal is {1}, the 2nd {2,4}, the 3rd {3,7,6} and so on. To produce a(6), all the integers from 1 to 6, we need 4 diagonals, so a(6)=4.

CROSSREFS

Cf. A003622.

Sequence in context: A105195 A257569 A039836 * A221671 A301640 A061420

Adjacent sequences:  A083395 A083396 A083397 * A083399 A083400 A083401

KEYWORD

nonn

AUTHOR

Jon Perry, Jun 06 2003

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 21 20:03 EDT 2019. Contains 322328 sequences. (Running on oeis4.)