|
Search: id:A109947
|
|
|
| A109947 |
|
Smallest prime == 1 (mod f(n)), where f(n) = concatenation 1,2,3...up to n. |
|
+0
4
|
|
| 2, 13, 739, 4937, 24691, 123457, 29629609, 24691357, 1234567891, 530864193131, 12345678910111, 1851851836516681, 74074073460667279, 76543209242689521469, 8395061658875624936221, 123456789101112131415161
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
MATHEMATICA
|
s = "1"; Do[s = s <> ToString[n]; k = ToExpression[s]; i = 1; While[ !PrimeQ[i*k + 1], i++ ]; Print[i*k + 1], {n, 2, 30}] (Propper)
|
|
CROSSREFS
|
Cf. A109948.
Sequence in context: A013111 A101342 A119122 this_sequence A064185 A069109 A004071
Adjacent sequences: A109944 A109945 A109946 this_sequence A109948 A109949 A109950
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 20 2005
|
|
EXTENSIONS
|
More terms from Ryan Propper (rpropper(AT)stanford.edu), Aug 01 2005
|
|
|
Search completed in 0.002 seconds
|
