id:A030758 - OEIS Search Results

Search: id:A030758

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

+0
1

1, 1, 3, 1, 4, 3, 1, 6, 4, 3, 2, 1, 8, 6, 4, 3, 2, 1, 11, 8, 6, 5, 4, 3, 2, 1, 13, 11, 8, 6, 5, 4, 3, 2, 1, 16, 13, 11, 10, 8, 7, 6, 5, 4, 3, 2, 1, 18, 16, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 22, 18, 16, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 25 (list; graph; listen)

	OFFSET	`1,3`
	CROSSREFS	`Sequence in context: A090844 A008314 A104568 this_sequence A104764 A152842 A082909` `Adjacent sequences: A030755 A030756 A030757 this_sequence A030759 A030760 A030761`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.

AT&T Labs Research