id:A024879 - OEIS Search Results

Search: id:A024879

Displaying 1-1 of 1 results found.

page 1

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

+0
1

0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 2, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 2, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 2, 0, 0, 0, 0, 3, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 2, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 2, 0, 1, 0, 0, 2, 1, 0, 1, 1 (list; graph; listen)

	OFFSET	`2,27`
	CROSSREFS	`Sequence in context: A035162 A121454 A025462 this_sequence A024316 A101669 A086965` `Adjacent sequences: A024876 A024877 A024878 this_sequence A024880 A024881 A024882`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified September 5 19:27 EDT 2008. Contains 143485 sequences.

AT&T Labs Research