|
Search: id:A132185
|
|
|
| A132185 |
|
a(n) is the largest number beginning with 1 such that, for any m, the number formed from the first m digits of a(n) is congruent to n mod m. |
|
+0
3
|
|
| 144408645048225636603816, 1725676121534561296189, 188276429246387492222, 19838179232721317143537, 12764828245698443284086, 176903816597810123057, 18626438463030625206604, 19352559475935751347112, 16128296082816884008108
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Obviously, each such number has at least ten digits; thence one can extend with diminishing probability. But a(211131)=1715193991236363935195556991413939 has 34 digits!
|
|
EXAMPLE
|
a(3) = 19838179232721317143537 because 19 == 3 mod 2, 198 == 3 mod 3, 1983 == 3 mod 4,..., 19838179232721317143537 == 3 mod 23; but no additional digit makes a 3 mod 24 number.
|
|
CROSSREFS
|
Cf. A051883, A109032, A113538, A132187, A134595.
Sequence in context: A008916 A105299 A094232 this_sequence A003942 A003935 A008872
Adjacent sequences: A132182 A132183 A132184 this_sequence A132186 A132187 A132188
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
Philippe LALLOUET (philip.lallouet(AT)orange.fr), Nov 04 2007
|
|
EXTENSIONS
|
Edited by Don Reble (djr(AT)nk.ca), Nov 07 2007
|
|
|
Search completed in 0.002 seconds
|
