Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,1

CROSSREFS

Sequence in context: A073693 A100261 A016526 this_sequence A096103 A143441 A016527

Adjacent sequences: A030744 A030745 A030746 this_sequence A030748 A030749 A030750

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 December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research