|
Search: id:A100003
|
|
|
| A100003 |
|
Prime numbers n such that the concatenation of all odd primes up through n in decreasing order is prime. |
|
+0
5
|
| |
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Next term is greater than 4400-th prime and the prime corresponding to the next term has more than 20000 digits. Number of digits of primes corresponding to the six known terms of the sequence are respectively 1,2,9,43,198 & 4202.
We can see the prime corresponding to 383 (the 5-th term of the sequence) in the page related to puzzle 8 of the website of Carlos Rivera.
|
|
LINKS
|
C. Rivera, Primes by Listing.
|
|
EXAMPLE
|
17 is in the sequence because 17.13.11.7.5.3 is prime (dot between numbers means concatenation).
|
|
MATHEMATICA
|
Do[If[PrimeQ[(v={}; Do[v=Join[v, IntegerDigits[Prime[n-j+1]]], {j, n-1}]; FromDigits[v])], Print[Prime[n]]], {n, 2, 4413}]
|
|
CROSSREFS
|
Cf. A046284, A099070, A099071, A099073.
The actual prime concatenations in A092448 and the original concatenations in A092447. [From Dmitry Kamenetsky (dkamen(AT)rsise.anu.edu.au), Mar 02 2009]
Sequence in context: A137460 A102295 A102846 this_sequence A114161 A087858 A084723
Adjacent sequences: A100000 A100001 A100002 this_sequence A100004 A100005 A100006
|
|
KEYWORD
|
base,more,nonn,nice
|
|
AUTHOR
|
Farideh Firoozbakht (mymontain(AT)yahoo.com), Nov 06 2004
|
|
|
Search completed in 0.002 seconds
|
