id:A025066 - OEIS Search Results

Search: id:A025066

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 ] and s = A023532.

+0
1

0, 1, 1, 0, 2, 1, 2, 2, 3, 2, 3, 4, 3, 4, 4, 5, 6, 5, 5, 6, 7, 6, 8, 7, 8, 8, 10, 8, 9, 10, 10, 11, 11, 11, 12, 11, 12, 14, 14, 13, 14, 15, 14, 15, 16, 15, 18, 16, 17, 17, 19, 19, 19, 19, 19, 20, 21, 20, 21, 22, 23, 23, 23, 22, 24, 24, 24, 26, 26, 25, 26, 28, 27, 27, 28, 27, 31, 28, 30, 30, 30, 30, 32, 32 (list; graph; listen)

	OFFSET	`1,5`
	CROSSREFS	`Sequence in context: A029263 A097575 A103273 this_sequence A051275 A025799 A053267` `Adjacent sequences: A025063 A025064 A025065 this_sequence A025067 A025068 A025069`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research