A022902 - OEIS

This site is supported by donations to The OEIS Foundation.

A022902

Number of solutions to c(1)p(3)+...+c(n)p(n+2) = 2, where c(i) = +-1 for i>1, c(1) = 1, p(i) = primes.

0, 1, 0, 0, 0, 2, 0, 1, 0, 9, 0, 24, 0, 55, 0, 139, 0, 593, 0, 1816, 0 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,6`
	CROSSREFS	`Sequence in context: A185415 A049218 A154469 * A037273 A158924 A025426` `Adjacent sequences: A022899 A022900 A022901 * A022903 A022904 A022905`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

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

Last modified February 14 07:48 EST 2012. Contains 205597 sequences.