This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A132185 #3 Oct 19 2017 03:15:07 %S A132185 144408645048225636603816,1725676121534561296189, %T A132185 188276429246387492222,19838179232721317143537, %U A132185 12764828245698443284086,176903816597810123057,18626438463030625206604,19352559475935751347112,16128296082816884008108 %N 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. %C A132185 Obviously, each such number has at least ten digits; thence one can extend with diminishing probability. But a(211131)=1715193991236363935195556991413939 has 34 digits! %e A132185 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. %Y A132185 Cf. A051883, A109032, A113538, A132187, A134595. %K A132185 nonn,base,easy %O A132185 0,1 %A A132185 Philippe LALLOUET (philip.lallouet(AT)orange.fr), Nov 04 2007 %E A132185 Edited by _Don Reble_, Nov 07 2007