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 A134595 #3 Oct 19 2017 03:15:07 %S A134595 1080548820,1121114531,1010249842,1115859543,1064928464,1105018975, %T A134595 1026605496,1303211957,1012880068,1113933789,1002529000,1139156391, %U A134595 1080784472,1121350183,1010485494,1111055105,1000603246,1101719337 %N A134595 a(n) is the smallest number such that, for any m, the number formed from the first m digits of a(n) is congruent to n mod m; but no digit can be appended to maintain the condition. %C A134595 Obviously, each such number has at least ten digits. Smaller numbers (like 1020005640 for 0 mod m) can be extended (to 10200056405). %e A134595 a(1) = 1121114531 because 11 == 1 mod 2, 112 == 1 mod 3, 1211 == 1 mod 4, ..., 1121114531 == 1 mod 10 but there is no digit such that 1121114531d == 1 mod 11. (10 is not a digit.) %Y A134595 Cf. A051883, A132185, A132187. %K A134595 nonn,base,easy %O A134595 0,1 %A A134595 Philippe LALLOUET (philip.lallouet(AT)orange.fr), Nov 04 2007 %E A134595 Edited by _Don Reble_, Nov 07 2007