id:A024890 - OEIS Search Results

Search: id:A024890

Displaying 1-1 of 1 results found.

page 1

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023531, t = A014306.

+0
1

0, 0, 1, 0, 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 2, 2, 3, 3, 2, 3, 3, 2, 3, 3, 3, 3, 4, 4, 4, 4, 3, 4, 4, 3, 4, 4, 3, 5, 5, 5, 4, 5, 5, 5, 5, 4, 5, 5, 5, 5, 5, 5, 6, 6, 5, 6, 6, 5, 5, 6, 6, 5, 6, 6, 6, 6, 5, 7, 7, 7, 7, 7, 6, 7, 7, 7, 7, 7, 7, 6, 7, 7, 6, 7, 7, 7, 8, 7, 8, 7, 8, 8, 8, 8, 7, 8, 7, 8, 8, 8, 8, 7, 8, 8, 8, 8, 9, 8, 8, 9 (list; graph; listen)

	OFFSET	`2,9`
	CROSSREFS	`Sequence in context: A107800 A085761 A102382 this_sequence A007895 A053260 A140223` `Adjacent sequences: A024887 A024888 A024889 this_sequence A024891 A024892 A024893`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 20 00:58 EST 2009. Contains 171054 sequences.

AT&T Labs Research