A022899 - OEIS

This site is supported by donations to The OEIS Foundation.

A022899

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

0, 1, 0, 1, 0, 1, 0, 3, 0, 6, 0, 19, 0, 61, 0, 197, 0, 644, 0 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`1,8`
	LINKS	`Table of n, a(n) for n=1..19.`
	CROSSREFS	`Sequence in context: A115456 A007386 A007385 * A081978 A117784 A197807` `Adjacent sequences: A022896 A022897 A022898 * A022900 A022901 A022902`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling`
	STATUS	`approved`

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

Last modified May 18 18:42 EDT 2013. Contains 225423 sequences.