id:A030768 - OEIS Search Results

Search: id:A030768

Displaying 1-1 of 1 results found.

page 1

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 2 in row 1.

+0
1

2, 2, 1, 2, 1, 4, 3, 2, 1, 5, 4, 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, 13, 12, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 18, 16, 15, 13, 12, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 21, 19, 18, 16, 15, 13, 12, 11, 10, 9, 8 (list; graph; listen)

	OFFSET	`1,1`
	CROSSREFS	`Sequence in context: A000924 A109909 A144387 this_sequence A051480 A071572 A125916` `Adjacent sequences: A030765 A030766 A030767 this_sequence A030769 A030770 A030771`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.

AT&T Labs Research