id:A156643 - OEIS Search Results

Search: id:A156643

Displaying 1-1 of 1 results found.

page 1

Number of decompositions of 4n+2 into unordered sums of two primes of the form 4k+1

+0
1

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

	OFFSET	`0,9`
	COMMENT	`a(n)=A002375(n)-A156642(n). Conjecture. For sufficiently large n, a(n)>0.`
	CROSSREFS	`A002144 A156642 A002375 A061358 A002372 A045917` `Sequence in context: A118206 A029314 A071635 this_sequence A128664 A003823 A059451` `Adjacent sequences: A156640 A156641 A156642 this_sequence A156644 A156645 A156646`
	KEYWORD	`nonn`
	AUTHOR	`Vladimir Shevelev (shevelev(AT)bgu.ac.il), Feb 12 2009`

page 1

Search completed in 0.002 seconds

Last modified November 27 14:34 EST 2009. Contains 167570 sequences.

AT&T Labs Research