A022896 - OEIS

This site is supported by donations to The OEIS Foundation.

A022896

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

1, 0, 0, 0, 0, 0, 2, 0, 4, 0, 14, 0, 40, 0, 125, 0, 394, 0, 1294, 0, 4356 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,7`
	CROSSREFS	`Sequence in context: A137449 A056946 A111757 * A100225 A007420 A019219` `Adjacent sequences: A022893 A022894 A022895 * A022897 A022898 A022899`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

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

Last modified February 15 16:56 EST 2012. Contains 205825 sequences.