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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A095840 Number of ways to write the n-th prime power as sum of two prime powers. 6
0, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 3, 3, 2, 3, 4, 3, 3, 7, 2, 3, 3, 2, 3, 2, 2, 3, 7, 2, 2, 3, 2, 4, 4, 3, 2, 2, 2, 2, 2, 4, 2, 3, 1, 11, 3, 3, 4, 0, 2, 3, 1, 3, 3, 3, 1, 4, 1, 1, 2, 4, 2, 1, 3, 3, 2, 1, 3, 5, 1, 12, 3, 2, 1, 3, 2, 2, 3, 2, 4, 2, 1, 2, 2, 0, 1, 1, 3, 2, 4, 2, 3, 2, 0, 2, 3, 1, 2, 2, 2, 1, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

a(n) = A071330(A000961(n)).

See A095842 and A095841 for prime powers having not more than one partition into two prime powers.

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

EXAMPLE

A000961(8) = 3^2 = 9 = 1+8 = 2+7 = 4+5, therefore a(8)=3.

PROG

(Haskell)

a095840 = a071330 . a000961  -- Reinhard Zumkeller, Jan 11 2013

CROSSREFS

Sequence in context: A162345 A048689 A069923 * A131343 A089051 A108229

Adjacent sequences:  A095837 A095838 A095839 * A095841 A095842 A095843

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Jun 10 2004

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified June 23 09:27 EDT 2018. Contains 305693 sequences. (Running on oeis4.)