login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A108422 Greatest number of ones that can be used to write in binary representation 2*n as sum of two primes. 2
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; refs; listen; history; internal format)
OFFSET

2,1

COMMENTS

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 * A084616 A196259 A071193

Adjacent sequences:  A108419 A108420 A108421 * A108423 A108424 A108425

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 03 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 12:15 EST 2012. Contains 205909 sequences.