id:A108422 - OEIS Search Results

Search: id:A108422

Displaying 1-1 of 1 results found.

page 1

Greatest number of ones that can be used to write in binary representation 2*n as sum of two primes.

+0
3

2, 4, 4, 5, 5, 6, 5, 6, 6, 6, 6, 6, 6, 7, 6, 7, 7, 8, 7, 8, 8, 8, 7, 8, 8, 9, 7, 8, 9, 10, 7, 8, 8, 9, 8, 9, 9, 10, 8, 9, 9, 8, 9, 10, 10, 10, 8, 8, 9, 9, 9, 10, 10, 10, 9, 9, 8, 10, 10, 10, 8, 10, 8, 9, 9, 10, 9, 10, 10, 9, 9, 10, 9, 11, 9, 10, 11, 12, 9, 10, 10, 10, 10, 11, 9, 12, 8, 9, 11, 10, 8, 12 (list; graph; listen)

	OFFSET	`2,1`
	COMMENT	`a(n) = Max{A000120(p)+A000120(q): p,q prime and p+q=2*n);` `a(n) = A108423(n) + A108421(n).`
	LINKS	`Index entries for sequences related to Goldbach conjecture` `Index entries for sequences related to binary expansion of n`
	CROSSREFS	`Cf. A108421, A004676, A007088, A005843.` `Sequence in context: A036443 A036437 A053306 this_sequence A084616 A071193 A071192` `Adjacent sequences: A108419 A108420 A108421 this_sequence A108423 A108424 A108425`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 03 2005`

page 1

Search completed in 0.002 seconds

Last modified December 16 13:01 EST 2009. Contains 170825 sequences.

AT&T Labs Research