Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,1

CROSSREFS

Adjacent sequences: A030725 A030726 A030727 this_sequence A030729 A030730 A030731

Sequence in context: A134699 A003636 A078929 this_sequence A138291 A062174 A102368

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 October 11 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research