A024692 - OEIS

This site is supported by donations to The OEIS Foundation.

A024692

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

1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	CROSSREFS	`Sequence in context: A014054 A014099 A037011 * A079978 A164704 A068429` `Adjacent sequences: A024689 A024690 A024691 * A024693 A024694 A024695`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

Content is available under The OEIS End-User License Agreement .

Last modified February 14 08:18 EST 2012. Contains 205608 sequences.