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 A140501 #12 Mar 08 2015 18:49:35
%S A140501 9123567480,9123675840,9123756480,9126573840,9132576840,9132657480,
%T A140501 9132765840,9135648720,9135726840,9138546720,9138675240,9147528360,
%U A140501 9153276840,9153672480,9153768240,9156237840,9156348720,9162573480
%N A140501 Ten-digit numbers with all distinct digits such that the string formed by the last k digits is divisible by k for any k <= 10.
%H A140501 Tanya Khovanova, Jun 29 2008, <a href="/A140501/b140501.txt">Table of n, a(n) for n = 1..202</a> (full sequence)
%H A140501 Tanya Khovanova, <a href="http://blog.tanyakhovanova.com/?p=31">A Very Special Ten-Digit Number</a>
%e A140501 9123567480 is in this sequence, because 80/2 = 40, 480/3 = 160, 7480/4 = 1870, 67480/5 = 13496, 567480/6 = 94580, 3567480/7 = 509640, 23567480/8 = 2945935, 123567480/9 = 13729720, 9123567480/10 = 912356748.
%t A140501 Map[FromDigits, Select[Permutations[{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}], #[[1]] == 9 && Mod[FromDigits[{#[[8]], #[[9]], #[[10]]}], 120] == 0 && Mod[ #[[5]] + #[[6]] + #[[7]], 3] == 0 && Mod[FromDigits[Take[ #, -7]], 7] == 0 &]]
%K A140501 fini,full,nonn,base
%O A140501 1,1
%A A140501 _Tanya Khovanova_, Jun 29 2008
%E A140501 Edited by _Charles R Greathouse IV_, Aug 02 2010