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 A090490 #5 Dec 05 2013 19:56:37 %S A090490 1,110,11100,1111000,111110000,11111100000,1111111000006, %T A090490 111111110000064,11111111100000648,1111111111000006480, %U A090490 111111111110000064800,11111111111100000648000,1111111111111000006480005,111111111111110000064800052,11111111111111100000648000525 %N A090490 For n > 1, a(n) is the least multiple of n that can be obtained by adding one digit to each end of a(n-1). %C A090490 Sequence has 15 terms. No multiple of 16 can be obtained in this way from a(15). - _David Wasserman_, Dec 06 2005 %e A090490 a(8) = 111111110000064 is a multiple of 8 and is the concatenation of 1, a(7) and 4. %Y A090490 Cf. A078282. %K A090490 base,nonn,easy,fini,full %O A090490 1,2 %A A090490 _Amarnath Murthy_, Dec 03 2003 %E A090490 More terms from _David Wasserman_, Dec 06 2005