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-8 of 8 results.

A083978 Smallest palindromic prime containing exactly n 7's.

Original entry on oeis.org

7, 727, 72727, 77377, 1777771, 7772777, 17772727771, 777767777, 72777777727, 77777677777, 7767777777677, 7777774777777, 377777777777773, 777777727777777, 72777777777777727, 77777777677777777, 7776777777777776777, 717777777787777777717, 737777777777777777737
Offset: 1

Views

Author

Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 21 2003

Keywords

Crossrefs

Programs

  • Mathematica
    Table[d = 7; i = 1;
     While[ x = IntegerDigits[Prime[i]];
      x != Reverse[x] || Count[x, d] != n , i++];
    FromDigits[x], {n, 1, 6}]  (* Robert Price, Mar 25 2019 *)

Extensions

Corrected and extended by Ray G. Opao, Sep 08 2004
Corrected and extended by Giovanni Resta, Feb 08 2006

A083972 Smallest palindromic prime containing exactly n 1's.

Original entry on oeis.org

313, 11, 18181, 11311, 1311131, 1114111, 110111011, 111181111, 11115151111, 1011117111101, 1110111110111, 1111118111111, 111111212111111, 111111151111111, 11121111111112111, 1011111110111111101, 1111111611161111111, 111110111171111011111, 1111111111111111111, 111111111161111111111, 11111111181118111111111, 1101111111119111111111011
Offset: 1

Views

Author

Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 21 2003

Keywords

Crossrefs

Programs

  • Mathematica
    digOfInterest = 1;
    primes = {};
    While[Length[primes] < 6,
      n = Length[primes] + 1;
      i = 0;
      While[Length[primes] != n,
       i++;
       dig = IntegerDigits[Prime[i]];
       If[
        (dig == Reverse[dig]) &&
         (Count[dig, digOfInterest] == n),
        AppendTo[primes, FromDigits[dig]];
        ];
       ];
      ];
    primes
    (* Kevin Southwick, Jul 25 2015 *)

Extensions

More terms from David Wasserman, Dec 06 2004
Corrected and extended by Giovanni Resta, Feb 08 2006
2 more terms from Erich Friedman, Mar 23 2008

A083973 Smallest palindromic prime containing exactly n 2's.

Original entry on oeis.org

2, 12421, 72227, 1221221, 3222223, 122232221, 322222223, 12222122221, 1202222222021, 1222227222221, 9222222222229, 122222232222221, 32222322222322223, 72222222422222227, 1202222222222222021, 1222222226222222221, 125222222222222222521, 722222222202222222227
Offset: 1

Views

Author

Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 21 2003

Keywords

Crossrefs

Programs

  • Mathematica
    Table[d = 2; i = 1;
     While[ x = IntegerDigits[Prime[i]];
      x != Reverse[x] || Count[x, d] != n , i++];
    FromDigits[x], {n, 1, 6}]  (* Robert Price, Mar 25 2019 *)

Extensions

Corrected and extended by Giovanni Resta, Feb 08 2006

A083977 Smallest palindromic prime containing exactly n 6's.

Original entry on oeis.org

10601, 16061, 16661, 1660661, 7666667, 166636661, 10666666601, 36666766663, 1766666666671, 3666662666663, 1666666666661, 366666656666663, 11666666666666611, 36666666766666663, 16666666666666661, 3666666665666666663, 1666666666666666661, 166666666636666666661
Offset: 1

Views

Author

Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 21 2003

Keywords

Crossrefs

Programs

  • Mathematica
    Table[d = 6; i = 1;
     While[ x = IntegerDigits[Prime[i]];
      x != Reverse[x] || Count[x, d] != n , i++];
    FromDigits[x], {n, 1, 5}]  (* Robert Price, Mar 25 2019 *)

Extensions

More terms from Giovanni Resta, Feb 08 2006

A083979 Smallest palindromic prime containing exactly n 8's.

Original entry on oeis.org

181, 18181, 78887, 1880881, 9888889, 188868881, 188888881, 18888588881, 1488888888841, 7888886888887, 3888888888883, 188888858888881, 188888888888881, 38888888088888883, 1688888888888888861, 3888888882888888883, 128888888888888888821
Offset: 1

Views

Author

Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 21 2003

Keywords

Crossrefs

Programs

  • Mathematica
    Table[d = 8; i = 1;
    While[ x = IntegerDigits[Prime[i]];
      x != Reverse[x] || Count[x, d] != n , i++];
    FromDigits[x], {n, 1, 5}]  (* Robert Price, Mar 25 2019 *)
    Module[{prs=Select[Prime[Range[105*10^5]],PalindromeQ]},Table[ SelectFirst[ prs,DigitCount[ #,10,8]==n&],{n,6}]] (* The program generates the first 6 terms of the sequence. *) (* Harvey P. Dale, May 11 2022 *)

Extensions

Corrected and extended by Giovanni Resta, Feb 08 2006

A083980 Smallest palindromic prime containing exactly n 9's.

Original entry on oeis.org

191, 919, 19991, 1993991, 9199919, 199909991, 199999991, 90999599909, 95999999959, 99999199999, 9599999999959, 199999959999991, 959999999999959, 39999999299999993, 94999999999999949, 99999999299999999, 9299999999999999929, 9999999992999999999
Offset: 1

Views

Author

Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 21 2003

Keywords

Crossrefs

Programs

  • Mathematica
    Table[d = 9; i = 1;
     While[ x = IntegerDigits[Prime[i]];
      x != Reverse[x] || Count[x, d] != n , i++];
    FromDigits[x], {n, 1, 5}]  (* Robert Price, Mar 25 2019 *)

Extensions

Corrected and extended by Giovanni Resta, Feb 08 2006

A083981 Smallest palindromic prime containing exactly n zeros.

Original entry on oeis.org

101, 10301, 1300031, 1003001, 100404001, 100030001, 10060006001, 10000500001, 1000030300001, 1000008000001, 140000000000041, 300000020000003, 10000003030000001, 10000000500000001, 1000000400040000001, 1000000008000000001, 100000000303000000001
Offset: 1

Views

Author

Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 21 2003

Keywords

Crossrefs

Programs

  • Mathematica
    Table[d = 0; i = 1;
     While[ x = IntegerDigits[Prime[i]];
      x != Reverse[x] || Count[x, d] != n , i++];
    FromDigits[x], {n, 1, 5}]  (* Robert Price, Mar 25 2019 *)

Extensions

Corrected and extended by Giovanni Resta, Feb 08 2006

A083974 Smallest palindromic prime containing exactly n 3's.

Original entry on oeis.org

3, 313, 13331, 33533, 1333331, 3331333, 323333323, 13333633331, 31333333313, 1333335333331, 3233333333323, 133333353333331, 332333333333233, 333333313333333, 33233333333333233, 1333333336333333331, 3333333313133333333, 133333333383333333331
Offset: 1

Views

Author

Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 21 2003

Keywords

Crossrefs

Programs

  • Mathematica
    Table[d = 3; i = 1;
     While[ x = IntegerDigits[Prime[i]];
      x != Reverse[x] || Count[x, d] != n , i++];
    FromDigits[x], {n, 1, 6}]  (* Robert Price, Mar 25 2019 *)

Extensions

More terms from Giovanni Resta, Feb 08 2006
Showing 1-8 of 8 results.