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-10 of 29 results. Next

A047777 Primes seen in the decimal expansion of Pi (disregarding the decimal point) that are contiguous, smallest and distinct.

Original entry on oeis.org

3, 14159, 2, 653, 5, 89, 7, 9323
Offset: 1

Views

Author

Keywords

Comments

Sequence A121267 gives the number of digits of a(n) [but see also A229181 for a variant, cf. below]. The terms a(9)-a(11) had been found by Chris Nash in October 1999, and primality of the 3057-digit term a(9) has been proved in September 2002 by J. K. Andersen, who also found the next 5 terms a(12)-a(16) and the bound a(17) > 10^32000, cf. Rivera's web page "Problem 18". - M. F. Hasler, Aug 31 2013
There is a natural variant of the present sequence, using the same definition except for not requiring that all primes have to be distinct. That variant would have the same 3057-digit prime as next term a(9), and therefore have the same displayed terms and not justify a separate entry in the OEIS. However, terms beyond a(9) would be different: instead of a(10) = 73, a(11) = 467 and the 14650-digit PRP a(11), it would be followed by a'(10) = 7, a'(11) = 3 (which cuts a(10) = 73 in two pieces), a'(12) = 467, a'(13) = a'(14) = 2, and a'(15) equal to a 748-digit prime, see the a-file from J.-F. Alcover. Sequence A229181 lists the size of these terms. - M. F. Hasler, Sep 15 2013, updated Jan 18 2019

Examples

			The first digit of Pi = 3.14159... is the prime 3, therefore a(1) = 3.
We discard this digit 3, and look for the first time a chunk of subsequent digits (always starting with the 1 coming right after the previously used 3) would be prime: 1, 14, 141, 1415 are not, but 14159 is. (The single-digit prime '5' was not considered, because we require the primes made from the whole contiguous chunk of digits starting after the previously found prime.) Thus, a(2) = 14159.
Thereafter, we have the single-digit prime a(3) = 2, and then a(4) = 653 (since neither 6 nor 65 is prime). - _M. F. Hasler_, Jan 18 2019
		

Crossrefs

Programs

Extensions

The next term is the 3057-digit prime formed from digits 19 through 3075. It is 846264338327950...708303906979207. - Mark R. Diamond, Feb 22 2000
The two terms after that are 73 and 467. - Jason Earls, Apr 05 2001

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

A007512 Primes of the form floor(e*10^k), i.e., formed by concatenation of an initial segment of the decimal expansion of e.

Original entry on oeis.org

2, 271, 2718281, 2718281828459045235360287471352662497757247093699959574966967627724076630353547594571
Offset: 1

Views

Author

Keywords

Comments

The number of digits in a(n) is given in A064118. This allows us to get larger terms that cannot be displayed here, via the given FORMULA. Sequences A005042, A072952, A115453, A119343, A210704, ... are the analogs for Pi, gamma, sqrt(2), sqrt(3), 3^(1/3), ... - M. F. Hasler, Aug 31 2013

References

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

Programs

  • Maple
    Digits := 110; n0 := evalf(E); for i from 1 to 100 do t1 := trunc(10^i*n0); if isprime(t1) then print(t1); fi; od:
  • PARI
    c=exp(1);for(k=0,precision(c),ispseudoprime(c\.1^k) & print1(c\.1^k,",")) \\ M. F. Hasler, Sep 01 2013

Formula

a(n) = floor(e*10^(A064118(n)-1)). - M. F. Hasler, Aug 31 2013

Extensions

Next term is a 1781-digit BPSW-probable prime 2718281828459045235...211151368350627526023. - Randall L Rathbun, Feb 02 2002
Edited by T. D. Noe, Oct 30 2008
Edited by M. F. Hasler, Aug 31 2013

A065840 Numbers n such that the first n quaternary digits found in the base-10 expansion of Pi form a prime (when the decimal point is ignored).

Original entry on oeis.org

1, 2, 3, 5, 10, 19, 72, 115, 220, 315, 375, 12408
Offset: 1

Views

Author

Patrick De Geest, Nov 24 2001

Keywords

Comments

In other words, take the decimal expansion of Pi, drop any digits greater than 4, omit the decimal point and look for prefixes in the resulting string which form base-4 primes.
Numbers n such that A065838(n) is prime.
The next term in the sequence, if it exists, is greater than 10000. - Nathaniel Johnston, Nov 15 2010

Examples

			E.g., the first a(5) or 10 quaternary digits of Pi are 31.12332323{4} and 3112332323{4} is the prime 880571{10}.
		

Crossrefs

Programs

  • Mathematica
    p = First[ RealDigits[ Pi, 10, 10^5]]; p = p[[ Select[ Range[10^5], p[[ # ]] == 0 || p[[ # ]] == 1 || p[[ # ]] == 2 || p[[ # ]] == 3 & ]]]; Do[ If[ PrimeQ[ FromDigits[ Take[p, n], 4]], Print[ n]], {n, 1, 4000} ]

Extensions

a(12) from Chai Wah Wu, Apr 07 2020

A198018 Yet unseen primes occurring within the first 1,2,3,4,... digits of Pi, A000796 (ordered according to position of last, then initial digit).

Original entry on oeis.org

3, 31, 41, 5, 314159, 14159, 4159, 59, 2, 1592653, 653, 53, 141592653589, 89, 415926535897, 5926535897, 6535897, 35897, 5897, 97, 7, 358979, 58979, 79, 589793, 9265358979323, 9323, 23, 93238462643, 462643, 643, 43, 433, 41592653589793238462643383, 89793238462643383, 38462643383, 2643383, 383, 83
Offset: 1

Views

Author

M. F. Hasler, Oct 20 2011

Keywords

Comments

Consider the first, then the first two, then the first three, ..., terms of A000796, i.e., decimal digits of Pi. Look whether the concatenation of a certain number of subsequent digits yields a prime which did not yet occur earlier (and thus necessarily involves the last of the considered digits). If so, add this prime to the sequence.
Contains A005042 as a subsequence.

Examples

			The first digit of the sequence is the prime a(1)=3.
The first two digits, "3.1", yield the prime a(2)=31.
In "3.14" there are no more primes. In "3.141" there is the prime a(3)=41.
In "3.1415" there is the prime a(4)=5.
In "3.14159" we have the primes 314159, 14159, 4159 and 59.
		

Crossrefs

Cf. A198019 ("new" primes ordered w.r.t. their size instead of starting position).

Programs

  • PARI
    {my(PI=digits(Pi\.1^30), seen=[]); for(i=1, #PI-1, for(j=1, i, my(p=fromdigits(PI[j..i])); !isprime(p) || setsearch(seen, p) || print1(p", ") || seen=setunion(seen,[p])))} \\ edited to use current PARI syntax by Andrew Howroyd and M. F. Hasler, May 10 2021
    
  • PARI
    {my(a=List()); for(m=0, precision(.)-3, my(pi=Pi\.1^m, p); for(k=0, m, !isprime(p=pi%10^(m-k+1)) && setsearch(Set(a), p) && listput(a,p))); a} \\ M. F. Hasler, May 10 2021

A117721 Primes formed by the initial digits of the binary expansion of Pi.

Original entry on oeis.org

3, 6588397, 1686629713, 26986075409, 16703571626015105435307505830654230989, 13420802360424337830311681948440006481608388178854297901454212848703426437343610760199000777828079
Offset: 1

Views

Author

Carl R. White, Apr 13 2006

Keywords

Comments

Pi primes to base 2 (for base 10 see A005042). This sequence is the list of prime members of A068425.

Crossrefs

Cf. A004601 (the binary expansion), A005042, A068425, A065987 (where primes are).

A210704 Primes formed by initial digits of 3^(1/3) = A002581, i.e., of the form floor[3^(1/3)*10^k].

Original entry on oeis.org

144224957030740838232163, 144224957030740838232163831078010958839186925349935057754641619454168759682999733
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, 30.11.1931 - 29.8.2013.
See A210706 for the k-values. The keyword "less" for this records means that the next term (2488 digits) cannot be added / displayed here, and instead of listing further primes here, the k-values should be recorded in A210706.

Crossrefs

Cf. A005042 (analog for Pi), A007512 (analog for e), A115453 (analog for sqrt(2)), A119343 (analog for sqrt(3)), A072952 (analog for gamma).

Programs

  • Mathematica
    With[{cr3=RealDigits[CubeRoot[3],10,100][[1]]},Select[Table[FromDigits[Take[cr3,n]],{n,100}],PrimeQ]] (* Harvey P. Dale, Mar 30 2024 *)
  • PARI
    (c=sqrtn(3,3),v=1/*set to 0 for indices instead of values*/)->for(k=0,precision(c),ispseudoprime(p=c\.1^k)&&print1([k,p][1+v]","))

Formula

a(n) = floor[A002581 * 10^A210706(n)], where A002581 is taken as a constant.

A007523 Primes in A092845 (decimal expansion of Pi written backwards).

Original entry on oeis.org

3, 13, 51413, 951413, 2951413, 53562951413, 979853562951413
Offset: 1

Views

Author

Keywords

Comments

Next term is probably A092845(711), a 712-digit probable prime (Baillie-Pomerance-Selfridge-Wagstaff test, cf. PARI/GP documentation) beginning 2116599102453... and ending ...62648323979853562951413.
a(8) = A092845(711) is now a proven prime. - Sean A. Irvine, Jan 07 2018

Examples

			51413 is in the list because it is prime and its decimal reversal, 31415, is the first 5 digits of Pi.
		

References

  • M. Gardner, Whys and Wherefores, Univ. Chicago Press, 1989, p. 84.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Programs

  • Mathematica
    Module[{nn=1000,rd},d=RealDigits[Pi,10,nn][[1]];Select[Table[FromDigits[Reverse[Take[d,n]]],{n,nn}],PrimeQ]]  (* Harvey P. Dale, Jul 11 2023 *)

Formula

Equals A000040 intersect A092845.

Extensions

Edited by M. F. Hasler and N. J. A. Sloane, Mar 30 2008
Edited by T. D. Noe, Oct 30 2008

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

A138759 Indices for which A001203 (continued fraction for Pi) is prime.

Original entry on oeis.org

1, 2, 9, 11, 14, 17, 18, 19, 20, 23, 27, 28, 31, 36, 37, 39, 40, 46, 48, 49, 50, 52, 59, 65, 70, 71, 72, 73, 75, 85, 86, 90, 93, 95, 97, 101, 102, 105, 106, 109, 110, 111, 118, 120, 122, 123, 124, 127, 128, 131, 132, 133, 140, 142, 145, 146, 151, 152, 153, 155, 159
Offset: 1

Views

Author

M. F. Hasler, Mar 31 2008

Keywords

Examples

			This sequence starts 1,2,9,11,... since the first, 2nd, 9th, 11th...
term of sequence A001203 = (3, 7, 15, 1, 292, 1, 1, 1, 2, ...) are primes.
		

Crossrefs

Programs

  • Mathematica
    Position[ContinuedFraction[Pi,200],?PrimeQ]//Flatten(* _Harvey P. Dale, Aug 07 2019 *)
  • PARI
    default(realprecision,1000); t=contfrac(Pi); for( k=1,#t, isprime(t[k]) & print1(k","))

Formula

k is in A138759 <=> A001203(k) is in A000040
Showing 1-10 of 29 results. Next