|
Search: id:A135944
|
|
|
| A135944 |
|
Number of n-digit primes whose digits are all primes. |
|
+0
3
|
|
| 4, 4, 15, 38, 128, 389, 1325, 4643, 16623, 59241, 214432
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Number of primes of the form: ...d3d2d1d0 = d0 * 10 ^ 0 + d1 * 10 ^ 1 + d2 * 10 ^ 2 + d3 * 10 ^ 3... where d0, d1, d2, d3... are primes with one digit. The ith element of the sequence is the number of primes with i digits. Aproximation of the sum of the sequence up to a(k) for large values of k: sum(a(i), i=1..k) =10 ^ k / ( k *log(10))* ( 2/5)^(k-1).
|
|
EXAMPLE
|
a(4) = 38 because there are 38 numbers of the form d3d2d1d0 with d0, d1, d2, d3 prime numbers, namely 2237, 2273, 2333, 2357, 2377, 2557, ..., 7753, 7757.
|
|
CROSSREFS
|
Sequence in context: A138767 A048282 A068592 this_sequence A076821 A165825 A056959
Adjacent sequences: A135941 A135942 A135943 this_sequence A135945 A135946 A135947
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Giorgio Balzarotti & Paolo P. Lava (greenblue(AT)tiscali.it), Dec 07 2007
|
|
|
Search completed in 0.002 seconds
|
