cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A003067 Problimes (second definition).

This page as a plain text file.
%I A003067 M1037 #40 Jul 02 2025 16:01:54
%S A003067 2,4,7,10,13,17,21,25,29,34,39,44,49,54,59,64,69,74,79,84,90,96,102,
%T A003067 108,114,120,126,132,138,144,150,156,162,168,174,180,186,192,198,204,
%U A003067 210,216,222,228,235,242,249,256,263,270,277,284,291,298,305,312,319
%N A003067 Problimes (second definition).
%C A003067 It would be nice to have a clearer definition. - _N. J. A. Sloane_, Jul 21 2008
%C A003067 The g.f. (z**2+2+z**9+z**5)/(z-1)**2 conjectured by _Simon Plouffe_ in his 1992 dissertation is wrong.
%D A003067 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A003067 T. D. Noe, <a href="/A003067/b003067.txt">Table of n, a(n) for n=1..1000</a>
%H A003067 M. D. Hirschhorn, <a href="http://www.jstor.org/stable/2319173">How unexpected is the prime number theorem?</a>, Amer. Math. Monthly, 80 (1973), 675-677.
%H A003067 M. D. Hirschhorn, <a href="/A003066/a003066.pdf">How unexpected is the prime number theorem?</a>, Amer. Math. Monthly, 80 (1973), 675-677. [Annotated scanned copy]
%H A003067 R. C. Vaughan, <a href="http://blms.oxfordjournals.org/content/6/3/337.extract">The problime number theorem</a>, Bull. London Math. Soc., 6 (1974), 337-340.
%H A003067 Simon Plouffe, <a href="https://arxiv.org/abs/0911.4975">Approximations de séries génératrices et quelques conjectures</a>, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
%H A003067 Simon Plouffe, <a href="/A000051/a000051_2.pdf">1031 Generating Functions</a>, Appendix to Thesis, Montreal, 1992
%p A003067 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: # _James Sellers_, Mar 07 2000
%t A003067 a[1] = 2; a[n_] := a[n] = Round[a[n-1] + 1/Product[1-1/a[j], {j, 1, n-1}]]; Table[a[n], {n, 1, 60}] (* _Jean-François Alcover_, Mar 09 2012, after _James Sellers_ *)
%Y A003067 Cf. A003066, A003068.
%K A003067 nonn,nice
%O A003067 1,1
%A A003067 _N. J. A. Sloane_
%E A003067 More terms from _James Sellers_, Mar 07 2000