cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

4, 6, 12, 22, 67, 114, 314, 509, 1278, 4594, 6873, 21674, 44624, 63304, 124801, 329984, 831879, 1121566, 2679756, 4697276, 6185762, 13848729, 23338552, 49996014, 133231027, 214481227, 271249053, 431149496, 541946349, 851376741
Offset: 1

Views

Author

Parthasarathy Nambi, Sep 28 2004

Keywords

Examples

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

Crossrefs

Programs

  • Maple
    a:= n-> (p-> p+combinat[numbpart](p))(ithprime(n)):
    seq(a(n), n=1..30);  # Alois P. Heinz, Aug 26 2015
  • Mathematica
    Table[Prime[n] + PartitionsP[Prime[n]], {n, 1, 50}] (* Stefan Steinerberger, Feb 28 2006 *)

Formula

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

Extensions

More terms from Stefan Steinerberger, Feb 28 2006