id:A060433 - OEIS Search Results

Search: id:A060433

Displaying 1-1 of 1 results found.

page 1

a(n) is the smallest odd number that can be represented as the sum of one or more consecutive primes in n ways.

+0
1

9, 3, 5, 41, 1151, 311, 34421, 442019, 3634531, 48205429 (list; graph; listen)

	OFFSET	`0,1`
	LINKS	`C. Rivera, Prime Puzzles`
	EXAMPLE	`a(2) = 5 because of 5 and 2+3 = 5. a(3) = 41 because of 41, 2+3+5+7+11+13 = 41 and 11+13+17 = 41.`
	CROSSREFS	`Sequence in context: A011212 A145924 A153618 this_sequence A019737 A088543 A021985` `Adjacent sequences: A060430 A060431 A060432 this_sequence A060434 A060435 A060436`
	KEYWORD	`nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Apr 06 2001`
	EXTENSIONS	`Edited by Larry Reeves (larryr(AT)acm.org), Apr 25 2001`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.