id:A054845 - OEIS Search Results

Search: id:A054845

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
9

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`
	REFERENCES	`R. K. Guy, Unsolved Problems In Number Theory, C2.`
	LINKS	`T. D. Noe, Table of n, a(n) for n=0..10000` `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.` `41 = 41 = 11+13+17 = 2+3+5+7+11+13, so a(41)=3.`
	CROSSREFS	`Cf. A000586, A054859.` `Sequence in context: A141571 A164067 A113706 this_sequence A117163 A096863 A117210` `Adjacent sequences: A054842 A054843 A054844 this_sequence A054846 A054847 A054848`
	KEYWORD	`nice,nonn`
	AUTHOR	`Jud McCranie (j.mccranie(AT)comcast.net), May 25 2000`
	EXTENSIONS	`Edited by N. J. A. Sloane (njas(AT)research.att.com), Oct 27 2008 at the suggestion of Jake M. Foster.`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research