|
Search: id:A003067
|
|
|
| A003067 |
|
Problimes (second definition).
(Formerly M1037)
|
|
+0
3
|
|
| 2, 4, 7, 10, 13, 17, 21, 25, 29, 34, 39, 44, 49, 54, 59, 64, 69, 74, 79, 84, 90, 96, 102, 108, 114, 120, 126, 132, 138, 144, 150, 156, 162, 168, 174, 180, 186, 192, 198, 204, 210, 216, 222, 228, 235, 242, 249, 256, 263, 270, 277, 284, 291, 298, 305, 312, 319
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
It would be nice to have a clearer definition. - N. J. A. Sloane (njas(AT)research.att.com), Jul 21 2008
The g.f. (z**2+2+z**9+z**5)/(z-1)**2 conjectured by S. Plouffe in his 1992 dissertation is wrong.
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
M. D. Hirschhorn, How unexpected is the prime number theorem?, Amer. Math. Monthly, 80 (1973), 675-677.
R. C. Vaughan, The problime number theorem, Bull. London Math. Soc., 6 (1974), 337-340.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
|
|
MAPLE
|
a[1] := 2: for i from 1 to 150 do a[i+1] := round(a[i]+1/product((1-1/a[j]), j=1..i)): od:
|
|
CROSSREFS
|
Cf. A003066, A003068.
Sequence in context: A135678 A001195 A127762 this_sequence A130243 A061465 A126022
Adjacent sequences: A003064 A003065 A003066 this_sequence A003068 A003069 A003070
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms and Maple code from James A. Sellers (sellersj(AT)math.psu.edu), Mar 07 2000
|
|
|
Search completed in 0.002 seconds
|
