A262369 -id:A262369 - cp's OEIS frontend

A045711 Primes with first digit 5.

5, 53, 59, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 5003, 5009, 5011, 5021, 5023, 5039, 5051, 5059, 5077, 5081, 5087, 5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179, 5189, 5197, 5209, 5227, 5231, 5233, 5237, 5261

Offset: 1

Felice Russo

Subsequence of A000040.

Vincenzo Librandi, Table of n, a(n) for n = 1..5000

Column k=5 of A262369.

For primes with initial digit d (1 <= d <= 9) see A045707, A045708, A045709, A045710, A045711, A045712, A045713, A045714, A045715; A073517, A073516, A073515, A073514, A073513, A073512, A073511, A073510, A073509.

[p: p in PrimesUpTo(5300) | Intseq(p)[#Intseq(p)] eq 5]; // Vincenzo Librandi, Aug 08 2014

Select[Table[Prime[n], {n, 5300}], First[IntegerDigits[#]]==5 &] (* Vincenzo Librandi, Aug 08 2014 *)

from itertools import chain, count, islice
from sympy import primerange
def A045711_gen(): # generator of terms
    return chain.from_iterable(primerange(5*(m:=10**l),6*m) for l in count(0))
A045711_list = list(islice(A045711_gen(),40)) # Chai Wah Wu, Dec 08 2024

from sympy import primepi
def A045711(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def f(x): return n+x+primepi(min(5*(m:=10**(l:=len(str(x))-1))-1,x))-primepi(min(6*m-1,x))+sum(primepi(5*(m:=10**i)-1)-primepi(6*m-1) for i in range(l))
    return bisection(f,n,n) # Chai Wah Wu, Dec 08 2024

More terms from Erich Friedman.

Leading 5 added by Jaroslav Krizek, Apr 29 2010

A045707 Primes with first digit 1.

Original entry on oeis.org

11, 13, 17, 19, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151

Offset: 1

Felice Russo

Also primes with all divisors starting with digit 1. Complement of A206288 (nonprime numbers with all divisors starting with digit 1) with respect to A206287 (numbers with all divisors starting with digit 1). - Jaroslav Krizek, Mar 04 2012
Cohen and Katz show that the set of primes with first digit 1 has no natural density, but has supernatural/Dirichlet density log_{10} (2) ~= 0.3, the primes with first digit 2 have (supernatural) density log_{10} (3/2) ~= 0.176, ... and the primes with first digit 9 have density log_{10} (10/9) ~= 0.046. This would seem to explain the first digit phenomenon. Note that sum_{k = 1}^9 log_{10} (k+1)/k = 1. - Gary McGuire, Dec 22 2004
Lower density is 1/9, upper density is 5/9. The Dirichlet density, if it exists, is always between the lower and upper density (as it does and is in this case). - Charles R Greathouse IV, Sep 26 2022

Vincenzo Librandi, Table of n, a(n) for n = 1..5000
Daniel I. A. Cohen and Talbot M. Katz, Prime numbers and the first digit phenomenon, J. Number Theory 18 (1984), 261-268.

For primes with initial digit d (1 <= d <= 9) see A045707 (1, this sequence), A045708 (2), A045709 (3), A045710 (4), A045711 (5), A045712 (6), A045713 (7), A045714 (8), A045715 (9).
Cf. A073517, A073516, A073515, A073514, A073513, A073512, A073511, A073510, A073509
Column k=1 of A262369.

[p: p in PrimesUpTo(10^4) | IsOne(Intseq(p)[#Intseq(p)])]; // Bruno Berselli, Jul 19 2014

Select[Table[Prime[n], {n, 500}], First[IntegerDigits[#]] == 1 &]
Flatten[Table[Prime[Range[PrimePi[10^n] + 1, PrimePi[2 * 10^n]]], {n, 3}]] (* Alonso del Arte, Jul 18 2014 *)

list(lim)=my(v=[]); for(d=1,#digits(lim\=1)-1, v=concat(v,primes([10^d,min(lim,2*10^d-1)]))); v \\ Charles R Greathouse IV, Sep 26 2022

from itertools import chain, count, islice
from sympy import primerange
def A045707_gen(): # generator of terms
    return chain.from_iterable(primerange(m:=10**l,(m<<1)) for l in count(0))
A045707_list = list(islice(A045707_gen(),40)) # Chai Wah Wu, Dec 07 2024

from sympy import primepi
def A045707(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def f(x): return n+x+primepi((m:=10**(l:=len(str(x))-1))-1)-primepi(min((m<<1)-1,x))+sum(primepi((m:=10**i)-1)-primepi((m<<1)-1) for i in range(l))
    return bisection(f,n,n) # Chai Wah Wu, Dec 07 2024

More terms from Erich Friedman.

Cohen-Katz reference from Victor S. Miller, Dec 21 2004

A045708 Primes with first digit 2.

Original entry on oeis.org

2, 23, 29, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221

Offset: 1

Felice Russo

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Cf. A000040.
For primes with initial digit d (1 <= d <= 9) see A045707, A045708, A045709, A045710, A045711, A045712, A045713, A045714, A045715; A073517, A073516, A073515, A073514, A073513, A073512, A073511, A073510, A073509
Cf. A000030, subsequence of A208272.
Column k=2 of A262369.

a045708 n = a045708_list !! (n-1)
a045708_list = filter ((== 2) . a000030) a000040_list
-- Reinhard Zumkeller, Mar 16 2012

[p: p in PrimesUpTo(2300) | Intseq(p)[#Intseq(p)] eq 2]; // Vincenzo Librandi, Aug 08 2014

Select[Table[Prime[n], {n, 3000}], First[IntegerDigits[#]]==2 &] (* Vincenzo Librandi, Aug 08 2014 *)

from sympy import isprime
def agen(limit=float('inf')):
  yield 2
  digits, adder = 1, 20
  while True:
    for i in range(1, 10**digits, 2):
      test = adder + i
      if test > limit: return
      if isprime(test): yield test
    digits, adder = digits+1, adder*10
agento = lambda lim: agen(limit=lim)
print(list(agento(2222))) # Michael S. Branicky, Feb 23 2021

from sympy import primepi
def A045708(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def f(x): return n+x+primepi(min(((m:=10**(l:=len(str(x))-1))<<1)-1,x))-primepi(min(3*m-1,x))+sum(primepi(((m:=10**i)<<1)-1)-primepi(3*m-1) for i in range(l))
    return bisection(f,n,n) # Chai Wah Wu, Dec 07 2024

See A045707 for comments on density of these sequences.

More terms from Erich Friedman.

Offset fixed by Reinhard Zumkeller, Mar 15 2012

A045709 Primes with first digit 3.

Original entry on oeis.org

3, 31, 37, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217, 3221, 3229

Offset: 1

Felice Russo

Vincenzo Librandi, Table of n, a(n) for n = 1..5000

Cf. A000040.
For primes with initial digit d (1 <= d <= 9) see A045707, A045708, A045709, A045710, A045711, A045712, A045713, A045714, A045715; A073517, A073516, A073515, A073514, A073513, A073512, A073511, A073510, A073509.
Column k=3 of A262369.

[p: p in PrimesUpTo(3300) | Intseq(p)[#Intseq(p)] eq 3]; // Vincenzo Librandi, Aug 08 2014

Select[Table[Prime[n], {n, 4000}], First[IntegerDigits[#]]==3 &] (* Vincenzo Librandi, Aug 08 2014 *)

isok(n) = isprime(n) && (digits(n, 10)[1] == 3) \\ Michel Marcus, Jun 08 2013

from itertools import chain, count, islice
from sympy import primerange
def A045709_gen(): # generator of terms
    return chain.from_iterable(primerange(3*(m:=10**l),m<<2) for l in count(0))
A045709_list = list(islice(A045709_gen(),40)) # Chai Wah Wu, Dec 07 2024

from sympy import primepi
def A045709(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def f(x): return n+x+primepi(min(3*(m:=10**(l:=len(str(x))-1))-1,x))-primepi(min((m<<2)-1,x))+sum(primepi(3*(m:=10**i)-1)-primepi((m<<2)-1) for i in range(l))
    return bisection(f,n,n) # Chai Wah Wu, Dec 07 2024

More terms from Erich Friedman.

A045714 Primes with first digit 8.

Original entry on oeis.org

83, 89, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 8009, 8011, 8017, 8039, 8053, 8059, 8069, 8081, 8087, 8089, 8093, 8101, 8111, 8117, 8123, 8147, 8161, 8167, 8171, 8179, 8191, 8209, 8219, 8221, 8231, 8233, 8237, 8243

Offset: 1

Felice Russo

Vincenzo Librandi, Table of n, a(n) for n = 1..5000

For primes with initial digit d (1 <= d <= 9) see A045707, A045708, A045709, A045710, A045711, A045712, A045713, A045714, A045715; A073517, A073516, A073515, A073514, A073513, A073512, A073511, A073510, A073509.

Column k=8 of A262369.

[p: p in PrimesUpTo(10^4) | Intseq(p)[#Intseq(p)] eq 8]; // Bruno Berselli, Jul 19 2014

Flatten[Table[Prime[Range[PrimePi[8 * 10^n] + 1, PrimePi[9 * 10^n]]], {n, 3}]] (* Alonso del Arte, Jul 19 2014 *)

from itertools import chain, count, islice
from sympy import primerange
def A045714_gen(): # generator of terms
    return chain.from_iterable(primerange((m:=10**l)<<3,9*m) for l in count(0))
A045714_list = list(islice(A045714_gen(),40)) # Chai Wah Wu, Dec 08 2024

from sympy import primepi
def A045714(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def f(x): return n+x+primepi(min(((m:=10**(l:=len(str(x))-1))<<3)-1,x))-primepi(min(9*m-1,x))+sum(primepi(((m:=10**i)<<3)-1)-primepi(9*m-1) for i in range(l))
    return bisection(f,n,n) # Chai Wah Wu, Dec 08 2024

More terms from Erich Friedman.

A045710 Primes with first digit 4.

Original entry on oeis.org

41, 43, 47, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057, 4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139, 4153, 4157, 4159, 4177, 4201, 4211

Offset: 1

Felice Russo

Vincenzo Librandi, Table of n, a(n) for n = 1..5000

For primes with initial digit d (1 <= d <= 9) see A045707, A045708, A045709, A045710, A045711, A045712, A045713, A045714, A045715; A073517, A073516, A073515, A073514, A073513, A073512, A073511, A073510, A073509.

Column k=4 of A262369.

[p: p in PrimesUpTo(10^4) | Intseq(p)[#Intseq(p)] eq 4]; // Bruno Berselli, Jul 19 2014

Select[Table[Prime[n], {n, 1000}], First[IntegerDigits[#]] == 4 &]
Flatten[Table[Prime[Range[PrimePi[4 * 10^n] + 1, PrimePi[5 * 10^n]]], {n, 3}]] (* Alonso del Arte, Jul 19 2014 *)

from itertools import chain, count, islice
from sympy import primerange
def A045710_gen(): # generator of terms
    return chain.from_iterable(primerange((m:=10**l)<<2,5*m) for l in count(0))
A045710_list = list(islice(A045710_gen(),40)) # Chai Wah Wu, Dec 08 2024

from sympy import primepi
def A045710(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def f(x): return n+x+primepi(min(((m:=10**(l:=len(str(x))-1))<<2)-1,x))-primepi(min(5*m-1,x))+sum(primepi(((m:=10**i)<<2)-1)-primepi(5*m-1) for i in range(l))
    return bisection(f,n,n) # Chai Wah Wu, Dec 08 2024

More terms from Erich Friedman.

A045712 Primes with first digit 6.

Original entry on oeis.org

61, 67, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 6007, 6011, 6029, 6037, 6043, 6047, 6053, 6067, 6073, 6079, 6089, 6091, 6101, 6113, 6121, 6131, 6133, 6143, 6151, 6163, 6173, 6197, 6199, 6203, 6211, 6217, 6221, 6229

Offset: 1

Felice Russo

Vincenzo Librandi, Table of n, a(n) for n = 1..5000

For primes with initial digit d (1 <= d <= 9) see A045707, A045708, A045709, A045710, A045711, A045712, A045713, A045714, A045715; A073517, A073516, A073515, A073514, A073513, A073512, A073511, A073510, A073509.

Column k=6 of A262369.

[p: p in PrimesUpTo(10^4) | Intseq(p)[#Intseq(p)] eq 6]; // Bruno Berselli, Jul 19 2014

Flatten[Table[Prime[Range[PrimePi[6 * 10^n] + 1, PrimePi[7 * 10^n]]], {n, 3}]] (* Alonso del Arte, Jul 19 2014 *)
Select[Table[Prime[n],{n, 7000}], First[IntegerDigits[#]]==6 &] (* Vincenzo Librandi, Aug 08 2014 *)

from itertools import chain, count, islice
from sympy import primerange
def A045712_gen(): # generator of terms
    return chain.from_iterable(primerange(6*(m:=10**l),7*m) for l in count(0))
list(islice(A045712_gen(),40)) # Chai Wah Wu, Dec 08 2024

from sympy import primepi
def A045712(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def f(x): return n+x+primepi(min(6*(m:=10**(l:=len(str(x))-1))-1,x))-primepi(min(7*m-1,x))+sum(primepi(6*(m:=10**i)-1)-primepi(7*m-1) for i in range(l))
    return bisection(f,n,n) # Chai Wah Wu, Dec 08 2024

More terms from Erich Friedman.

A045713 Primes with first digit 7.

Original entry on oeis.org

7, 71, 73, 79, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103, 7109, 7121, 7127, 7129, 7151, 7159, 7177, 7187, 7193, 7207, 7211, 7213, 7219, 7229, 7237, 7243, 7247, 7253, 7283

Offset: 1

Felice Russo

Vincenzo Librandi, Table of n, a(n) for n = 1..5000

Cf. A000040.
For primes with initial digit d (1 <= d <= 9) see A045707, A045708, A045709, A045710, A045711, A045712, A045713, A045714, A045715; A073517, A073516, A073515, A073514, A073513, A073512, A073511, A073510, A073509.
Column k=7 of A262369.

[p: p in PrimesUpTo(7300) | Intseq(p)[#Intseq(p)] eq 7]; // Vincenzo Librandi, Aug 08 2014

Select[ Table[ Prime[ n ], {n, 1000} ], First[ IntegerDigits[ # ]]==7& ]

from itertools import chain, count, islice
from sympy import primerange
def A045713_gen(): # generator of terms
    return chain.from_iterable(primerange(7*(m:=10**l),m<<3) for l in count(0))
A045713_list = list(islice(A045713_gen(),40)) # Chai Wah Wu, Dec 08 2024

from sympy import primepi
def A045713(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def f(x): return n+x+primepi(min(7*(m:=10**(l:=len(str(x))-1))-1,x))-primepi(min((m<<3)-1,x))+sum(primepi(7*(m:=10**i)-1)-primepi((m<<3)-1) for i in range(l))
    return bisection(f,n,n) # Chai Wah Wu, Dec 08 2024

More terms from Erich Friedman.
Corrected by Jud McCranie, Jan 03 2001
a(13)=757 added from Vincenzo Librandi, Aug 08 2014

A045715 Primes with first digit 9.

Original entry on oeis.org

97, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 9001, 9007, 9011, 9013, 9029, 9041, 9043, 9049, 9059, 9067, 9091, 9103, 9109, 9127, 9133, 9137, 9151, 9157, 9161, 9173, 9181, 9187, 9199, 9203, 9209, 9221, 9227, 9239, 9241, 9257

Offset: 1

Felice Russo

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

For primes with initial digit d (1 <= d <= 9) see A045707, A045708, A045709, A045710, A045711, A045712, A045713, A045714, A045715; A073517, A073516, A073515, A073514, A073513, A073512, A073511, A073510, A073509.

Column k=9 of A262369.

[p: p in PrimesUpTo(10^4) | Intseq(p)[#Intseq(p)] eq 9]; // Bruno Berselli, Jul 19 2014

[p: p in PrimesInInterval(9*10^n,10^(n+1)), n in [0..3]]; // Bruno Berselli, Aug 08 2014

Flatten[Table[Prime[Range[PrimePi[9 * 10^n] + 1, PrimePi[10^(n + 1)]]], {n, 3}]] (* Alonso del Arte, Jul 19 2014 *)

from itertools import chain, count, islice
def A045715_gen(): # generator of terms
    return chain.from_iterable(primerange(9*(m:=10**l),10*m) for l in count(0))
A045715_list = list(islice(A045715_gen(),40)) # Chai Wah Wu, Dec 08 2024

from sympy import primepi
def A045715(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def f(x): return n+x+primepi(min(9*(m:=10**(l:=len(str(x))-1))-1,x))-primepi(min(10*m-1,x))+sum(primepi(9*(m:=10**i)-1)-primepi(10*m-1) for i in range(l))
    return bisection(f,n,n) # Chai Wah Wu, Dec 08 2024

More terms from Erich Friedman.

A018800 Smallest prime that begins with n.

Original entry on oeis.org

11, 2, 3, 41, 5, 61, 7, 83, 97, 101, 11, 127, 13, 149, 151, 163, 17, 181, 19, 2003, 211, 223, 23, 241, 251, 263, 271, 281, 29, 307, 31, 3203, 331, 347, 353, 367, 37, 383, 397, 401, 41, 421, 43, 443, 457, 461, 47, 487, 491, 503, 5101, 521, 53, 541, 557, 563, 571, 587, 59

Offset: 1

David W. Wilson

Conjecture: If a(n) = (n concatenated with k) then k < n. - Amarnath Murthy, May 01 2002

a(n) always exists. Proof. Suppose n is L digits long, and consider the numbers between n*10^B and n*10^B+10^C, where B > C are both large compared with L. All such numbers begin with the digits of n. Using the upper and lower bounds on pi(x) from Theorem 1 of Rosser and Schoenfeld, it follows that for sufficiently large B and C, at least one of these numbers is a prime. QED - N. J. A. Sloane, Nov 14 2014

T. D. Noe, Table of n, a(n) for n = 1..1000 (first 100 terms from Paolo P. Lava)
J. Barkley Rosser and Lowell Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), pp. 64-94.
Index entries for primes involving decimal expansion of n

Cf. A030665, A068164, A068695, A062584, A088781, A085608.
A164022 is the base-2 analog.
Cf. also A258337.
Row n=1 of A262369.

import Data.List (isPrefixOf, find); import Data.Maybe (fromJust)
a018800 n = read $ fromJust $
            find (show n `isPrefixOf`) $ map show a000040_list :: Int
-- Reinhard Zumkeller, Jul 01 2015

f:= proc(n) local x0, d,r,y;
   if isprime(n) then return(n) fi;
   for d from 1 do
     x0:= n*10^d;
     for r from 1 to 10^d-1 by 2 do
       if isprime(x0+r) then
          return(x0+r)
       fi
     od
   od
end proc:
seq(f(n),n=1..100); # Robert Israel, Dec 23 2014

Table[Function[d, FromDigits@ SelectFirst[ IntegerDigits@ Prime@ Range[10^4], Length@ # >= Length@ d && Take[#, Length@ d] == d &]][ IntegerDigits@ n], {n, 59}] (* Michael De Vlieger, May 24 2016, Version 10 *)

a(n{,base=10}) = for (l=0, oo, forprime (p=n*base^l, (n+1)*base^l-1, return (p))) \\ Rémy Sigrist, Jun 11 2017

from sympy import isprime
def a(n):
    if isprime(n): return n
    pow10 = 10
    while True:
        t, maxt = n * pow10 + 1, (n+1) * pow10
        while t < maxt:
            if isprime(t): return t
            t += 2
        pow10 *= 10
print([a(n) for n in range(1, 60)]) # Michael S. Branicky, Nov 02 2021

a(n) = prime(A085608(n)). - Michel Marcus, Oct 19 2013

cp's OEIS Frontend

A045711 Primes with first digit 5.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

Python

Python

Extensions

A045707 Primes with first digit 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Python

Python

Extensions

A045708 Primes with first digit 2.

Views

Author

Keywords

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

Python

Python

Formula

Extensions

A045709 Primes with first digit 3.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Python

Python

Extensions

A045714 Primes with first digit 8.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

Python

Python

Extensions

A045710 Primes with first digit 4.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

Python

Python

Extensions

A045712 Primes with first digit 6.