login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A063905
Each prime p appears p times.
3
2, 2, 3, 3, 3, 5, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 7, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19
OFFSET
1,1
COMMENTS
a(A007504(k)) = prime(k) and a(A007504(k) + 1) = prime(k + 1) for k > 0, where prime = A000040.
LINKS
EXAMPLE
a(A007504(4)) = prime(4) = 7 = a(17) and a(18) = a(A007504(4)+1) = prime(4+1) = prime(5) = 11.
MATHEMATICA
Flatten[Table[Prime[n], {n, 8}, {Prime[n]}]] (* Alonso del Arte, Sep 08 2011 based on Robert G. Wilson v's program for A002024 *)
Table[PadRight[{}, p, p], {p, Prime[Range[8]]}]//Flatten (* Harvey P. Dale, Mar 13 2023 *)
PROG
(PARI) { n=0; p=1; for (m=1, 10^9, p=nextprime(p+1); for (i=1, p, write("b063905.txt", n++, " ", p); if (n==1000, break)); if (n==1000, break) ) } \\ Harry J. Smith, Sep 02 2009
(Haskell)
a063905 n = a063905_list !! (n-1)
a063905_list =
concat $ zipWith ($) (map replicate a000040_list) a000040_list
-- Reinhard Zumkeller, Mar 18 2011
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Reinhard Zumkeller, Aug 30 2001
STATUS
approved