login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062305 Number of ways writing 2^n as a sum of a prime and a nonprime. 0
0, 0, 1, 2, 2, 7, 8, 25, 38, 75, 128, 259, 458, 876, 1598, 3024, 5672, 10753, 20372, 38656, 73547, 140669, 268537, 514307, 986379, 1896755, 3650109, 7036061 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

Table of n, a(n) for n=0..27.

FORMULA

a(n)=A062602(2^n) = number of prime+nonprime partitions of 2^n.

EXAMPLE

n = 5: 2^5 = 32 = 31+1 = 2+30 = 5+27 = 7+25 = 11+21 = 17+15 = 23+9 so a(5) = 7.

CROSSREFS

Cf. A061358, A062602, A062610.

Sequence in context: A019087 A293607 A026563 * A155063 A324666 A011022

Adjacent sequences:  A062302 A062303 A062304 * A062306 A062307 A062308

KEYWORD

nonn

AUTHOR

Labos Elemer, Jul 05 2001

EXTENSIONS

More terms from Dean Hickerson, Jul 23, 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 14 13:20 EDT 2021. Contains 343884 sequences. (Running on oeis4.)