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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003068 Problimes (third definition).
(Formerly M1038)
7
2, 4, 7, 11, 15, 19, 23, 28, 33, 38, 43, 48, 53, 58, 63, 68, 73, 79, 85, 91, 97, 103, 109, 115, 121, 127, 133, 139, 145, 151, 157, 163, 169, 175, 181, 187, 193, 199, 205, 211, 217, 224, 231, 238, 245, 252, 259, 266, 273, 280, 287, 294, 301, 308, 315, 322, 329 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

M. D. Hirschhorn, How unexpected is the prime number theorem?, Amer. Math. Monthly, 80 (1973), 675-677.

M. D. Hirschhorn, How unexpected is the prime number theorem?, Amer. Math. Monthly, 80 (1973), 675-677. [Annotated scanned copy]

R. C. Vaughan, The problime number theorem, Bull. London Math. Soc., 6 (1974), 337-340.

MAPLE

a[1] := 2: for i from 1 to 150 do a[i+1] := ceil(a[i]+1/product((1-1/a[j]), j=1..i)): od: # James A. Sellers, Mar 07 2000

MATHEMATICA

a[1] = 2; a[n_] := a[n] = Ceiling[a[n-1] + 1/Product[1 - 1/a[j], {j, 1, n-1}]]; Table[a[n], {n, 1, 60}] (* Jean-Fran├žois Alcover, Nov 18 2013 *)

CROSSREFS

Cf. A003066, A003067.

Sequence in context: A087163 A062467 A250621 * A194168 A198759 A078617

Adjacent sequences:  A003065 A003066 A003067 * A003069 A003070 A003071

KEYWORD

nonn,nice

AUTHOR

N. J. A. Sloane

EXTENSIONS

More terms from James A. Sellers, Mar 07 2000

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 15 22:10 EDT 2019. Contains 327088 sequences. (Running on oeis4.)