|
Search: id:A073176
|
|
|
| A073176 |
|
First n-digit prime in "the sequence of odd integers": 135791113151719212325272931333537394143454749... |
|
+0
2
|
|
| 3, 79, 911, 5791, 79111, 31051, 1232527, 23252729, 113151719, 2527293133, 57911131517, 991011031051, 6769717375777, 41434547495153, 192123252729313, 4547495153555759, 31517192123252729, 71921232527293133353
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Leading zeros count but are not printed (cf. A073428).
|
|
EXAMPLE
|
a(4)=5791 because first 4-digit prime in "the sequence of odd integers": 135791113151719212325272931333537394143454749... is 5791. Notice that a(6)=31051 because actually it is 031051, If we remove initial zeros, then a(6)=105107.
|
|
MATHEMATICA
|
p200=Flatten[IntegerDigits[2*Range[200]+1]]; Do[pn=Partition[p200, n, 1]; ln=Length[pn]; tab=Table[Sum[10^(n-k)*pn[[i, k]], {k, n}], {i, ln}]; tas=Select[tab, PrimeQ]; Print[{n, tas[[1]]}], {n, 20}]
|
|
CROSSREFS
|
Sequence in context: A092416 A069839 A064456 this_sequence A073428 A062660 A065399
Adjacent sequences: A073173 A073174 A073175 this_sequence A073177 A073178 A073179
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
Zak Seidov (zakseidov(AT)yahoo.com), Aug 22 2002
|
|
|
Search completed in 0.002 seconds
|
