|
Search: id:A093338
|
|
|
| A093338 |
|
Scan primes, write down initial digit if it is a prime. |
|
+0
1
|
|
| 2, 3, 5, 7, 2, 2, 3, 3, 5, 5, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
PROGRAM
|
(PARI) firstpr(n) = { forprime(x=2, n, fd = eval(mid(Str(x), 1, 1)); if(isprime(fd), print1(fd", ")) ) } \ Get a substring of length n from string str starting at position s in str. mid(str, s, n) = { v =""; tmp = Vec(str); ln=length(tmp); for(x=s, s+n-1, v=concat(v, tmp[x]); ); return(v) }
|
|
CROSSREFS
|
Cf. A077648.
Sequence in context: A130136 A032759 A142711 this_sequence A104212 A139751 A076779
Adjacent sequences: A093335 A093336 A093337 this_sequence A093339 A093340 A093341
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Apr 25 2004
|
|
|
Search completed in 0.002 seconds
|
