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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A030767 Row 1, where, at stage k>1, write i in row 1 and j in row 2, where i is 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 2 in row 1. 8
2, 1, 2, 1, 4, 3, 1, 1, 5, 4, 1, 3, 2, 6, 7, 1, 1, 2, 4, 4, 8, 9, 1, 1, 2, 2, 3, 7, 5, 10, 12, 1, 1, 2, 2, 4, 3, 5, 8, 7, 13, 15, 1, 1, 2, 2, 3, 4, 6, 4, 7, 10, 9, 16, 18, 1, 1, 2, 2, 3, 4, 5, 5, 8, 6, 8, 13, 11, 19, 21, 1, 1, 2, 2, 3, 4, 4, 1, 5, 6, 8, 9, 8, 11, 15 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

CROSSREFS

Sequence in context: A002331 A060805 A184342 * A135545 A123317 A171453

Adjacent sequences:  A030764 A030765 A030766 * A030768 A030769 A030770

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 18:33 EST 2012. Contains 205663 sequences.