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.

Showing 1-4 of 4 results.

A060421 Numbers k such that the first k digits of the decimal expansion of Pi form a prime.

Original entry on oeis.org

1, 2, 6, 38, 16208, 47577, 78073, 613373
Offset: 1

Views

Author

Michel ten Voorde, Apr 05 2001

Keywords

Comments

The Brown link states that in 2001 Ed T. Prothro reported discovering that 16208 gives a probable prime and that Prothro verified that all values for 500 through 16207 digits of Pi are composites. - Rick L. Shepherd, Sep 10 2002
The corresponding primes are in A005042. - Alexander R. Povolotsky, Dec 17 2007

Examples

			3 is prime, so a(1) = 1; 31 is prime, so a(2) = 2; 314159 is prime, so a(3) = 6; ...
		

Crossrefs

Primes in other constants: A064118 (e), A065815 (gamma), A064119 (phi), A118328 (Catalan's constant), A115377 (sqrt(2)), A119344 (sqrt(3)), A228226 (log 2), A228240 (log 10), A119334 (zeta(3)), A122422 (Soldner's constant), A118420 (Glaisher-Kinkelin constant), A174974 (Golomb-Dickman constant), A118327 (Khinchin's constant).
In other bases: A065987 (binary), A065989 (ternary), A065991 (quaternary), A065990 (quinary), A065993 (senary).

Programs

  • Mathematica
    Do[If[PrimeQ[FromDigits[RealDigits[N[Pi, n + 10], 10, n][[1]]]], Print[n]], {n, 1, 9016} ]

Extensions

a(6) = 47577 from Eric W. Weisstein, Apr 01 2006
a(7) = 78073 from Eric W. Weisstein, Jul 13 2006
a(8) = 613373 from Adrian Bondrescu, May 29 2016

A064118 Numbers k such that the first k digits of e form a prime.

Original entry on oeis.org

1, 3, 7, 85, 1781, 2780, 112280, 155025
Offset: 1

Views

Author

Shyam Sunder Gupta, Sep 09 2001

Keywords

Comments

The primes are given in A007512. Sequences A065815, A119344, A136583, A210706,... are analogs for gamma, sqrt(3), sqrt(10), 3^(1/3), .... The MathWorld page about "Constant Primes" lists further examples. - M. F. Hasler, Aug 31 2013

Examples

			a(2)=3 because the 3-digit number 271 is prime.
		

References

  • C. A. Pickover, The Mathematics of Oz, "2, 271, 2718281", Chapter 95, Camb.Univ.Press, UK 2002.

Crossrefs

Cf. A001113.
Cf. A047658.

Programs

  • Mathematica
    Do[If[PrimeQ[FromDigits[RealDigits[N[E, n + 10], 10, n][[1]]]], Print[n]], {n, 1, 2300}]

Extensions

One more term from Robert G. Wilson v, Sep 28 2001
a(6) from Eric W. Weisstein, Jan 17 2005
a(7) from Eric W. Weisstein, Jul 03 2009
a(8) from Eric W. Weisstein, Oct 11 2010

A072952 Primes obtained as initial segments of the decimal expansion of the Euler-Mascheroni constant gamma = 0.5772... .

Original entry on oeis.org

5, 577, 5772156649015328606065120900824024310421
Offset: 1

Views

Author

Shyam Sunder Gupta, Aug 12 2002

Keywords

Comments

The next term (a(4)) has 185 digits and is too large to include. - Harvey P. Dale, May 14 2013
Sequence A065815 gives the number of digits of a(n), resp. numbers k such that a(n) = floor(gamma*10^k). Sequences A005042, A007512, A115453, A119343, A210704, ... are the analog of the present sequence for Pi, e, sqrt(2), sqrt(3), 3^(1/3), ... - M. F. Hasler, Aug 31 2013
The original wording of the definition (and example) was "primes found in the decimal expansion..." which could as well refer to the sequence (5,7,7,215664901,5,3,2, ...) or (5,7,72156649, ...) or (5,7,7215664901, ...) (analogs to A047777 or A195834), or to the sequence (5,7,57, ...), analog to A198018. - M. F. Hasler, Sep 01 2013

Examples

			a(2) = 577, since 577 is the second prime obtained as initial segment of the decimal expansion of Euler-Mascheroni constant gamma = 0.577215664... .
		

Crossrefs

Analogous sequences: A005042 (Pi), A007512 (e), A115453 (sqrt(2)), A119343 (sqrt(3)), A210704 (3^(1/3)).

Programs

  • Mathematica
    nn=200;With[{emc=RealDigits[EulerGamma,10,nn][[1]]},Select[Table[ FromDigits[ Take[emc,n]],{n,nn}],PrimeQ]] (* Harvey P. Dale, May 14 2013 *)
  • PARI
    default(realprecision, 777); /* use that many digits */
    A072952={(c=Euler, v=1/*set to 0 for indices (i.e., A065815) instead of values*/)->for(k=0, precision(c), ispseudoprime(p=c\.1^k)&&print1([k, p][1+v]", "))} \\ M. F. Hasler, Aug 31 2013

A210706 Numbers k such that floor[ 3^(1/3)*10^k ] is prime.

Original entry on oeis.org

23, 80, 2487
Offset: 1

Views

Author

M. F. Hasler, Aug 31 2013

Keywords

Comments

Inspired by prime curios about 4957 (cf. LINKS), one of which honors the late Bruce Murray (Nov 30 1931 - Aug 29 2013).
Meant to be a "condensed" version of A210704, see there for more.
Alternate definition: Numbers k such that concatenation of the first (k+1) digits of A002581 yields a prime.

Examples

			t = 3^(1/3) = 1.44224957030740838232163831... multiplied by 10^23 yields
t*10^23 = 144224957030740838232163.831..., the integer part of which is the prime A210704(1), therefore a(1)=23.
		

Crossrefs

Cf. A002581 = decimal expansion of 3^(1/3).
Cf. A065815 (analog for gamma), A060421 (1+ analog for Pi), A064118 (1+ analog for exp(1)), A119344 (1 + analog for sqrt(3)), A136583 (1+ analog for sqrt(10)).

Programs

  • PARI
    \p2999
    t=sqrtn(3,3);for(i=1,2999,ispseudoprime(t\.1^i)&print1(i","))

Formula

a(n) = (length of A210704(n)) - 1, where "length" means number of decimal digits.
Showing 1-4 of 4 results.