|
Search: id:A076623
|
|
|
| A076623 |
|
Total number of left truncatable primes (without zeros) in base n. |
|
+0
11
|
|
| 0, 3, 16, 15, 454, 22, 446, 108, 4260, 75, 170053, 100, 34393, 9357, 27982, 362, 14979714, 685, 3062899, 59131, 1599447, 1372, 1052029701, 10484, 7028048, 98336, 69058060, 3926
(list; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
COMMENT
|
Approximation of a(b) by (PARI) code: l(b)=c=b*(b-1)/log(b)/eulerphi(b);\ return(floor((primepi(b)-omega(b))*exp(c)/c));
a(24)=1052029701 based on strong BPSW pseudoprimes. Other terms up to a(29) use proved primes. [From Martin Fuller (martin_n_fuller(AT)btinternet.com), Nov 24 2008]
|
|
REFERENCES
|
Angell, I. O. and Godwin, H. J. "On Truncatable Primes." Math. Comput. 31, 265-267, 1977.
|
|
LINKS
|
Martin Renner, Table of n, a(n) for n = 2..53, with many question marks
Index entries for sequences related to truncatable primes
|
|
PROGRAM
|
(PARI code from Robert Gerbicz (robert.gerbicz(AT)gmail.com), Oct 31 2008)
f(b)=ct=0; A=[0]; n=-1; L=1; while(L, n++; B=vector(L*b); M=0; \
for(i=1, L, for(j=1, b-1, x=A[i]+j*b^n; if(isprime[x], M++; B[M]=x; ct++))); \
L=M; A=vector(L, i, B[i])); return(ct)
|
|
CROSSREFS
|
Cf. A024779, A024780, A024781, A024782, A024783, A024784, A024785, A076586.
Cf. A103443, A103463.
Sequence in context: A098373 A054793 A063709 this_sequence A068516 A032922 A103655
Adjacent sequences: A076620 A076621 A076622 this_sequence A076624 A076625 A076626
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Martin Renner (martin.renner(AT)gmx.net), Oct 22 2002, Nov 03 2002, Sep 24 2007, Feb 20 2008, Apr 20 2008
|
|
EXTENSIONS
|
a(12) corrected from 170051 to 170053 by Martin Fuller (martin_n_fuller(AT)btinternet.com), Oct 31 2008
Correction of a(18) and approximation for a(n). - Robert Gerbicz (robert.gerbicz(AT)gmail.com), Nov 02 2008
a(24) - a(29) from Martin Fuller (martin_n_fuller(AT)btinternet.com), Nov 24 2008
|
|
|
Search completed in 0.002 seconds
|
