id:A030767 - OEIS Search Results

Search: id:A030767

Displaying 1-1 of 1 results found.

page 1

Row 1, where, at stage k>1, write i in row 1 and j in row 2, where i is 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
9

2, 1, 2, 1, 4, 3, 1, 1, 5, 4, 1, 3, 2, 6, 7, 1, 1, 2, 4, 4, 8, 9, 1, 1, 2, 2, 3, 7, 5, 10, 12, 1, 1, 2, 2, 4, 3, 5, 8, 7, 13, 15, 1, 1, 2, 2, 3, 4, 6, 4, 7, 10, 9, 16, 18, 1, 1, 2, 2, 3, 4, 5, 5, 8, 6, 8, 13, 11, 19, 21, 1, 1, 2, 2, 3, 4, 4, 1, 5, 6, 8, 9, 8, 11, 15 (list; graph; listen)

	OFFSET	`1,1`
	CROSSREFS	`Sequence in context: A029173 A002331 A060805 this_sequence A135545 A123317 A164879` `Adjacent sequences: A030764 A030765 A030766 this_sequence A030768 A030769 A030770`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 1 19:22 EST 2009. Contains 167811 sequences.

AT&T Labs Research