|
Search: id:A160914
|
|
|
| A160914 |
|
a(n+2)=largest n-digit prime formed by appending a digit to a(n+1); a(0)=82, a(1)=829, a(2)=8293. |
|
+0
1
|
|
| 82, 829, 8293, 82939, 829399, 8293993, 82939939, 829399399, 8293993993, 82939939933, 829399399333
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(0)=82(composite), a(1)=829(prime), a(2)=8293(prime). There is no prime a(11) since 8293993993331 to 8293993993339 are all composite.
|
|
MAPLE
|
>m:=[n]: print(op(m)); whille 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, A160674.
Sequence in context: A031422 A002309 A128959 this_sequence A083386 A160154 A093282
Adjacent sequences: A160911 A160912 A160913 this_sequence A160915 A160916 A160917
|
|
KEYWORD
|
base,fini,full,nonn,uned
|
|
AUTHOR
|
Vladislav-Stepan Malakhovsky and Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), May 31 2009
|
|
|
Search completed in 0.002 seconds
|
