id:A060436 - OEIS Search Results

Search: id:A060436

Displaying 1-1 of 1 results found.

page 1

Number of ways of representing n as the sum of one or more consecutive primes.

+0
1

0, 0, 1, 1, 0, 2, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 2, 1, 1, 0, 0, 0, 2, 1, 0, 1, 0, 1, 1, 1, 2, 0, 0, 0, 0, 2, 1, 0, 1, 0, 3, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 2, 0, 0, 1, 0, 1, 2, 2, 1, 0, 0, 0, 0, 0, 2, 1, 0, 0, 2, 2, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 3, 1, 0, 0, 0, 1, 1, 2, 0, 0, 0, 0, 1, 0, 2, 1, 0, 2, 2, 1, 1, 0 (list; graph; listen)

	OFFSET	`0,6`
	LINKS	`T. D. Noe, Table of n, a(n) for n=0..10000` `Matthew M. Conroy, Home page (listed instead of email address)` `C. Rivera, Prime Puzzles`
	EXAMPLE	`a(5)=2 because of 2+3 and 5. a(17)=2 because of 2+3+5+7 and 17.`
	CROSSREFS	`Cf. A000586.` `Sequence in context: A122434 A113706 A054845 this_sequence A117163 A096863 A117210` `Adjacent sequences: A060433 A060434 A060435 this_sequence A060437 A060438 A060439`
	KEYWORD	`nice,nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Apr 07 2001`
	EXTENSIONS	`Corrected and extended by Matthew M. Conroy, Apr 11 2001`

page 1

Search completed in 0.002 seconds

Last modified September 5 17:15 EDT 2008. Contains 143476 sequences.

AT&T Labs Research