Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,1

CROSSREFS

Sequence in context: A050169 A064048 A016464 this_sequence A128316 A065836 A078712

Adjacent sequences: A030724 A030725 A030726 this_sequence A030728 A030729 A030730

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research