|
|
A114009
|
|
Regular triangle where n-th row is composed of n primes beginning with prime(n).
|
|
2
|
|
|
2, 3, 31, 5, 53, 59, 7, 71, 73, 79, 11, 113, 1103, 1109, 1117, 13, 131, 137, 139, 1301, 1303, 17, 173, 179, 1709, 1721, 1723, 1733, 19, 191, 193, 197, 199, 1901, 1907, 1913, 23, 233, 239, 2309, 2311, 2333, 2339, 2341, 2347, 29, 293, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
One prime beginning with 2, followed by the two primes 3, 31 beginning with 3.
Triangle begins:
2;
3, 31;
5, 53, 59;
7, 71, 73, 79;
...
|
|
MATHEMATICA
|
f[n_] := Block[{c = 0, t = {}, p = Prime[n]}, k = PrimePi[p]; lng = Ceiling[Log[10, p]]; While[c < n, q = Prime[k]; If[p == FromDigits@Take[IntegerDigits@q, lng], c++; AppendTo[t, q]]; k++ ]; t]; Array[f, 10] // Flatten (* Robert G. Wilson v, Nov 17 2005 *)
|
|
PROG
|
(Python)
from itertools import count
from sympy import isprime, prime
def row(n):
if n == 1: return [2]
pn, c = prime(n), 1; out = [pn]
for d in count(1):
pow10 = 10**d
base = pn * pow10
for i in range(1, pow10, 2):
t = base + i
if isprime(t): out.append(t); c += 1
if c == n: return out
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|