|
Search: id:A109948
|
|
|
| A109948 |
|
Smallest prime == 1 (mod f(n)), where f(n) = concatenation n,n-1,...,3,2,1. |
|
+0
4
|
|
| 2, 43, 643, 51853, 108643, 3925927, 45925927, 525925927, 9876543211, 65925925927, 6665925925927, 1453331851851853, 1154657766913580249, 45219875551604938273, 7873482297771358024693, 742965003571105432098767
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
MATHEMATICA
|
s = "1"; Do[s = ToString[n] <> s; k = ToExpression[s]; i = 1; While[ !PrimeQ[i*k + 1], i++ ]; Print[i*k + 1], {n, 2, 30}] (Propper)
|
|
CROSSREFS
|
Cf. A109947.
Sequence in context: A073594 A112097 A142199 this_sequence A119775 A088466 A156478
Adjacent sequences: A109945 A109946 A109947 this_sequence A109949 A109950 A109951
|
|
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
|
