login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098145 p + P(p) where p is the n-th prime and P(p) is the unrestricted partition number of p. 4

%I #9 Aug 26 2015 23:32:36

%S 4,6,12,22,67,114,314,509,1278,4594,6873,21674,44624,63304,124801,

%T 329984,831879,1121566,2679756,4697276,6185762,13848729,23338552,

%U 49996014,133231027,214481227,271249053,431149496,541946349,851376741

%N p + P(p) where p is the n-th prime and P(p) is the unrestricted partition number of p.

%F a(n) = A000040(n) + A000041(A000040(n)).

%e If p=17, P(p) = 297 and 17 + 297 = 314.

%p a:= n-> (p-> p+combinat[numbpart](p))(ithprime(n)):

%p seq(a(n), n=1..30); # _Alois P. Heinz_, Aug 26 2015

%t Table[Prime[n] + PartitionsP[Prime[n]], {n, 1, 50}] (* _Stefan Steinerberger_, Feb 28 2006 *)

%Y Cf. A000040, A000041.

%K nonn

%O 1,1

%A _Parthasarathy Nambi_, Sep 28 2004

%E More terms from _Stefan Steinerberger_, Feb 28 2006

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)