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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Number of entries in {x,..} such that PrimePi[x]=Prime[n].

FORMULA

a(n) = Card{x; A000720(x) = A000040(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}]

CROSSREFS

Cf. A000720, A000040, A006450, A073123.

a[n]=A072677(n)-A006450(n)

Sequence in context: A079894 A114005 A103794 * A070877 A156717 A198889

Adjacent sequences:  A073121 A073122 A073123 * A073125 A073126 A073127

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jul 16 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 15:54 EST 2012. Contains 206050 sequences.