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.

A271107 Numbers k such that 33*10^k + 1 is prime.

Original entry on oeis.org

1, 2, 5, 6, 7, 8, 29, 47, 145, 205, 227, 505, 553, 600, 787, 809, 1305, 1447, 1593, 2285, 4763, 5679, 9133, 12516, 14869, 16536, 33402, 36085, 51933, 56443, 69133
Offset: 1

Views

Author

Robert Price, Mar 30 2016

Keywords

Comments

Numbers k such that the digits 33 followed by k-1 occurrences of the digit 0 followed by the digit 1 is prime (see Example section).
a(32) > 10^5.

Examples

			5 is in this sequence because 33*10^5+1 = 3300001 is prime.
Initial terms and associated primes:
a(1) = 1, 331;
a(2) = 2, 3301;
a(3) = 5, 3300001;
a(4) = 6, 33000001;
a(5) = 7, 330000001;
a(6) = 8, 3300000001, etc.
		

Crossrefs

Programs

  • Mathematica
    Select[Range[0, 100000], PrimeQ[33*10^#+1] &]
  • PARI
    lista(nn) = for(n=1, nn, if(ispseudoprime(33*10^n+1), print1(n, ", "))); \\ Altug Alkan, Mar 31 2016