login
A073124
a(n) = prime(1+prime(n)) - prime(prime(n)).
8
2, 2, 2, 2, 6, 2, 2, 4, 6, 4, 4, 6, 2, 2, 12, 10, 4, 10, 6, 6, 6, 8, 2, 2, 12, 10, 6, 6, 2, 2, 10, 4, 14, 12, 4, 4, 10, 4, 6, 2, 6, 4, 10, 10, 12, 6, 4, 14, 6, 4, 10, 12, 8, 4, 6, 24, 10, 6, 2, 8, 14, 18, 2, 6, 2, 12, 16, 4, 6, 6, 2, 6, 26, 2, 8, 10, 4, 10, 4
OFFSET
1,1
COMMENTS
Number of entries in {x,..} such that PrimePi[x]=Prime[n].
FORMULA
a(n) = Card{x; A000720(x) = A000040(n)}.
a(n) = A072677(n) - A006450(n).
EXAMPLE
n = 25: p(25) = 97, Pi[x] = 97 holds for 12 numbers: X = {509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520} so a(25) = 12. Largest 520 = A073123(25), smallest = A006450(25).
MATHEMATICA
Table[Prime[Prime[n]+1]-Prime[Prime[n]], {n, 1, 256}]
PROG
(PARI) a(n) = prime(1+prime(n)) - prime(prime(n)); \\ Michel Marcus, Dec 11 2013
CROSSREFS
KEYWORD
nonn
AUTHOR
Labos Elemer, Jul 16 2002
EXTENSIONS
More terms from Michel Marcus, Dec 11 2013
STATUS
approved