|
Search: id:A160673
|
|
|
| A160673 |
|
a(n)=smallest n-digit prime formed by appending a digit to a(n-1); a(0)=8402963. |
|
+0
1
|
|
| 8402963, 84029633, 840296333, 8402963339, 84029633399, 840296333999, 8402963339993, 84029633399939, 840296333999393, 8402963339993939, 84029633399939393
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
There is prime a(11) since 840296333999393931, 840296333999393933, 840296333999393937, 840296333999393939 are not prime.
|
|
EXAMPLE
|
a(0)=8402963, a(1)=84029633, a(2)=840296333, a(3)=8402963339, a(4)=84029633399, a(5)=840296333999, a(6)=8402963339993, a(7)=84029633399939, a(8)=840296333999393, a(9)=8402963339993939, a(10)=84029633399939393.
|
|
MAPLE
|
>m:=[n]:print(op(m)); while nops(m)>0 >do m:=select(isprime, map(proc(x) 10*x+1, 10*x+3, 10*x+7, 10*x+9 > end, m)): print(op(m)): >od:
|
|
CROSSREFS
|
Cf. A000040.
Sequence in context: A017709 A013971 A036101 this_sequence A049362 A081639 A141137
Adjacent sequences: A160670 A160671 A160672 this_sequence A160674 A160675 A160676
|
|
KEYWORD
|
base,easy,fini,full,nonn
|
|
AUTHOR
|
Vladislav-Stepan Malakhovsky and Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), May 23 2009
|
|
|
Search completed in 0.002 seconds
|
