id:A059965 - OEIS Search Results

Search: id:A059965

Displaying 1-1 of 1 results found.

page 1

For m>0, each n+m > 5 is expressed as Sum_{k = x,y,z}(pk)_m where (pk)_m is a prime with x <= y <= z; a(n) = largest m such that (pk)_1 = (pk)_2 = ... = (pk)_m.

+0
1

0, 0, 0, 0, 0, 7, 7, 6, 7, 6, 7, 6, 5, 5, 7, 6, 7, 6, 5, 5, 7, 6, 7, 6, 5, 4, 7, 6, 5, 4, 5, 5, 7, 6, 7, 6, 5, 4, 3, 3, 7, 6, 5, 5, 7, 6, 7, 6, 5, 4, 7, 6, 5, 4, 5, 4, 7, 6, 5, 4, 5, 5, 7, 6, 7, 6, 5, 4, 3, 3, 7, 6, 5, 5, 7, 6, 7, 6, 5, 4, 3, 3, 7, 6, 5, 4, 7, 6, 5, 4, 5, 4, 7, 6, 5, 4, 5, 4, 3, 3, 7, 6, 5, 5, 7 (list; graph; listen)

	OFFSET	`0,6`
	COMMENT	`Goldbach conjectured that every integer >5 is the sum of three primes. 6=2+2+2, 7=2+2+3, 8=2+3+3, 9=3+3+3=2+2+5,...`
	CROSSREFS	`Sequence in context: A019787 A093202 A019765 this_sequence A124930 A109939 A022619` `Adjacent sequences: A059962 A059963 A059964 this_sequence A059966 A059967 A059968`
	KEYWORD	`easy,nonn`
	AUTHOR	`Naohiro Nomoto (6284968128(AT)geocities.co.jp), Mar 05 2001`

page 1

Search completed in 0.002 seconds

Last modified December 19 12:50 EST 2009. Contains 171053 sequences.

AT&T Labs Research