|
Search: id:A096099
|
|
|
| A096099 |
|
a(0) = 1, a(n) = least number such that n-th partial concatenation is == 0 (mod prime(n)). |
|
+0
1
|
|
| 1, 2, 3, 5, 5, 2, 13, 25, 8, 22, 16, 26, 35, 35, 11, 26, 48, 58, 6, 46, 4, 77, 83, 29, 33, 187, 61, 78, 81, 23, 183, 15, 22, 68, 8, 137, 84, 178, 99, 7, 71, 82, 142, 241, 133, 71, 56, 19, 32, 318, 157, 199, 303, 16, 201, 201, 213, 257, 355, 229, 365, 379, 345, 27, 52, 19, 272
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Subsidiary sequence: n such that a(n) > prime(n). a(7) = 25 > prime(7) = 17. 7,...
|
|
EXAMPLE
|
a(7) = 25 as concatenation a(1),a(2)...a(6),a(7)= 1235521325==0 mod 17, prime(7) = 17.
|
|
MATHEMATICA
|
s = "1"; Print[s]; Do[k = 1; While[Mod[ToExpression[s <> ToString[k]], Prime[n]] != 0, k++ ]; Print[k]; s = s <> ToString[k], {n, 1, 100}] (Propper)
|
|
CROSSREFS
|
Cf. A073893.
Sequence in context: A111631 A118141 A082876 this_sequence A019780 A133293 A096289
Adjacent sequences: A096096 A096097 A096098 this_sequence A096100 A096101 A096102
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 24 2004
|
|
EXTENSIONS
|
More terms from Ryan Propper (rpropper(AT)stanford.edu), Sep 03 2005
|
|
|
Search completed in 0.002 seconds
|
