Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,1

CROSSREFS

Sequence in context: A138114 A124330 A055177 this_sequence A068119 A039992 A101988

Adjacent sequences: A030775 A030776 A030777 this_sequence A030779 A030780 A030781

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