This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 2
 144408645048225636603816, 1725676121534561296189, 188276429246387492222, 19838179232721317143537, 12764828245698443284086, 176903816597810123057, 18626438463030625206604, 19352559475935751347112, 16128296082816884008108 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Obviously, each such number has at least ten digits; thence one can extend with diminishing probability. But a(211131)=1715193991236363935195556991413939 has 34 digits! LINKS 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: A094232 A234594 A210704 * A003942 A003935 A008872 Adjacent sequences:  A132182 A132183 A132184 * A132186 A132187 A132188 KEYWORD nonn,base,easy AUTHOR Philippe LALLOUET (philip.lallouet(AT)orange.fr), Nov 04 2007 EXTENSIONS Edited by Don Reble, Nov 07 2007 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 12 22:06 EST 2019. Contains 329963 sequences. (Running on oeis4.)