Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,3

CROSSREFS

Adjacent sequences: A030754 A030755 A030756 this_sequence A030758 A030759 A030760

Sequence in context: A143319 A078011 A010285 this_sequence A004592 A116992 A090740

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 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research