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.

A257667 Primes containing a digit 5.

Original entry on oeis.org

5, 53, 59, 151, 157, 251, 257, 353, 359, 457, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 653, 659, 751, 757, 853, 857, 859, 953, 1051, 1151, 1153, 1259, 1451, 1453, 1459, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579
Offset: 1

Views

Author

Vincenzo Librandi, May 03 2015

Keywords

Comments

Subsequence of primes of A011535. - Michel Marcus, May 03 2015
Primes in A062671. - Bruno Berselli, May 03 2015

Crossrefs

Cf. prime numbers containing the string k: A208270 (k=1), A208272 (k=2), A212525 (k=3), this sequence (k=5), A257668 (k=7), A166571 (k=10), A166572 (k=11), A243529 (k=12), A166573 (k=13), A243530 (k=14), A243531 (k=15), A243532 (k=16), A166579 (k=17), A243527 (k=111), A166580 (k=222), A166581 (k=333), A166582 (k=444).
Cf. A011535, A062671, A243531 (subsequence).

Programs

  • Magma
    [p: p in PrimesUpTo(1600) | 5 in Intseq(p)];
    
  • Mathematica
    Select[Prime[Range[250]], ! StringFreeQ[ToString[#], "5"] &]
  • PARI
    forprime(p=1, 1600, if(vecsearch(vecsort(digits(p)), 5), print1(p, ", "))) \\ Derek Orr, May 05 2015; corrected by Michel Marcus, Oct 30 2023
  • Sage
    [p for p in primes(1600) if 5 in p.digits(base=10)] # Bruno Berselli, May 03 2015
    

Formula

a(n) ~ n log n. - Charles R Greathouse IV, Nov 01 2022

A243530 Prime numbers containing the string 14.

Original entry on oeis.org

149, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 2141, 2143, 5147, 6143, 8147, 10141, 11149, 11411, 11423, 11437, 11443, 11447, 11467, 11471, 11483, 11489, 11491, 11497, 12143, 12149, 13147, 14009, 14011, 14029
Offset: 1

Views

Author

Vincenzo Librandi, Jun 06 2014

Keywords

Crossrefs

Cf. similar sequences listed in A243529.

Programs

  • Mathematica
    Select[Prime[Range[2000]], !StringFreeQ[ToString[#], "14" ] &]
    Select[Prime[Range[2000]],SequenceCount[IntegerDigits[#],{1,4}]>0&] (* Harvey P. Dale, Aug 19 2025 *)
  • PARI
    contains(n,k)=my(N=digits(n),K=digits(k)); for(i=0,#N-#K, for(j=1,#K,if(N[i+j]!=K[j],next(2))); return(1)); 0
    is(n)=isprime(n) && contains(n,14) \\ Charles R Greathouse IV, Jun 20 2014

Formula

a(n) ~ n log n. - Charles R Greathouse IV, Jun 20 2014

A243531 Prime numbers containing the string 15.

Original entry on oeis.org

151, 157, 1151, 1153, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 2153, 4153, 4157, 4159, 5153, 6151, 7151, 7159, 9151, 9157, 10151, 10159, 11159, 11503, 11519, 11527, 11549, 11551, 11579, 11587, 11593, 11597, 12157, 13151, 13159
Offset: 1

Views

Author

Vincenzo Librandi, Jun 06 2014

Keywords

Crossrefs

Cf. similar sequences listed in A243529.

Programs

  • Mathematica
    Select[Prime[Range[2000]], !StringFreeQ[ToString[#], "15" ] &]
    Select[Prime[Range[2000]],SequenceCount[IntegerDigits[#],{1,5}]>0&] (* Harvey P. Dale, Sep 19 2023 *)
  • PARI
    contains(n,k)=my(N=digits(n),K=digits(k)); for(i=0,#N-#K, for(j=1,#K,if(N[i+j]!=K[j],next(2))); return(1)); 0
    is(n)=isprime(n) && contains(n,15) \\ Charles R Greathouse IV, Jun 20 2014

Formula

a(n) ~ n log n. - Charles R Greathouse IV, Jun 20 2014

A243532 Prime numbers containing the string 16.

Original entry on oeis.org

163, 167, 1163, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 2161, 3163, 3167, 3169, 5167, 6163, 8161, 8167, 9161, 10163, 10169, 11161, 11617, 11621, 11633
Offset: 1

Views

Author

Vincenzo Librandi, Jun 06 2014

Keywords

Crossrefs

Cf. similar sequences listed in A243529.

Programs

  • Mathematica
    Select[Prime[Range[2000]], !StringFreeQ[ToString[#], "16" ]&]
  • PARI
    contains(n,k)=my(N=digits(n),K=digits(k)); for(i=0,#N-#K, for(j=1,#K,if(N[i+j]!=K[j],next(2))); return(1)); 0
    is(n)=isprime(n) && contains(n,16) \\ Charles R Greathouse IV, Jun 20 2014

Formula

a(n) ~ n log n. - Charles R Greathouse IV, Jun 20 2014
Showing 1-4 of 4 results.