id:A102605 - OEIS Search Results

Search: id:A102605

Displaying 1-1 of 1 results found.

page 1

Number of ways of writing 2n+1 as p+q+r where p,q,r are primes with p < q < r, offset=0.

+0
1

0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 2, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 6, 6, 9, 8, 8, 11, 11, 10, 13, 13, 12, 14, 15, 13, 18, 17, 14, 21, 19, 17, 25, 20, 21, 26, 25, 22, 30, 28, 21, 32, 31, 23, 37, 32, 27, 39, 36, 32, 43, 41, 36, 45, 44, 35, 51, 48, 34, 54, 48, 36, 59, 50, 43, 60, 55, 46, 61 (list; graph; listen)

	OFFSET	`0,11`
	EXAMPLE	`a(n=19)=6 because 2n+1=39 and 39=3+5+31=3+7+29=3+13+23=3+17+19=5+11+23=7+13+19`
	CROSSREFS	`Number of ways of writing 2n+1 as p+q+r where p, q, r are primes with p <= q <= r gives A054860` `Sequence in context: A020911 A029125 A074990 this_sequence A112995 A078452 A135636` `Adjacent sequences: A102602 A102603 A102604 this_sequence A102606 A102607 A102608`
	KEYWORD	`base,nonn`
	AUTHOR	`Zak Seidov (zakseidov(AT)yahoo.com), Jan 29 2005`

page 1

Search completed in 0.002 seconds

Last modified December 6 11:04 EST 2009. Contains 170427 sequences.

AT&T Labs Research