login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A030757 Row 1, where, at stage k>1, write i in row 1 and j in row 2, where i is the number of j's in rows 1 and 2, for j=m,m-1,...2,1, where m=max number in row 1 from stages 1 to k-1; stage 1 is 1 in row 1. 10
1, 1, 3, 1, 4, 1, 2, 6, 1, 2, 3, 1, 8, 1, 2, 3, 5, 3, 11, 1, 2, 3, 1, 4, 8, 5, 13, 1, 2, 4, 4, 3, 6, 10, 7, 16, 1, 2, 3, 1, 5, 1, 6, 4, 9, 12, 9, 18, 1, 2, 3, 1, 4, 2, 2, 6, 2, 8, 6, 11, 14, 11, 22, 1, 2, 3, 1, 4, 2, 7, 3, 3, 8, 3, 11, 7, 13, 16, 16, 25, 1, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Sean A. Irvine, Table of n, a(n) for n = 1..1000

Sean A. Irvine, Java program (github)

CROSSREFS

Cf. A030707, A030708, A030709.

Sequence in context: A159878 A230767 A324116 * A004592 A116992 A233267

Adjacent sequences:  A030754 A030755 A030756 * A030758 A030759 A030760

KEYWORD

nonn

AUTHOR

Clark Kimberling

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 May 15 22:06 EDT 2021. Contains 343933 sequences. (Running on oeis4.)