Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A030708
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A030708 Row 2, 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=1,2,...,m, where m=max number in row 1 for stages 1 to j-1; stage 1 is 1 in row 1. +0
2
1, 1, 1, 3, 1, 3, 4, 1, 2, 3, 4, 6, 1, 2, 3, 4, 6, 8, 1, 2, 3, 4, 5, 6, 8, 11, 1, 2, 3, 4, 5, 6, 8, 11, 13, 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 13, 16, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 16, 18, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 18, 22, 1, 2 (list; graph; listen)
OFFSET

1,4

CROSSREFS

A030707=row 1

Sequence in context: A098743 A130560 A088105 this_sequence A095709 A076152 A107638

Adjacent sequences: A030705 A030706 A030707 this_sequence A030709 A030710 A030711

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 November 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research