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 A106848 #3 Mar 18 2017 21:27:26 %S A106848 1,1,1,1,1,1,1,1,1,1,2,0,6,6,3,0,16,9,18,1,6,2,22,0,0,6,27,6,28,1,15, %T A106848 0,2,16,6,0,3,18,6,1,5,6,21,2,9,22,46,0,42,1,48,0,13,27,2,0,18,28,58, %U A106848 1,60,15,6,0,6,2,33,16,22,1,35,0,8,3,0,0,2,6,13,1,81,5,41,6,16,21,84,2,44,1 %N A106848 a(n) = the number of times the last digit of n must be appended to n to form a number m such that n divides m, or 0 if no such m exists. %C A106848 Shares many terms in common with A064696, which involved inserting zeros between digits. Numbers which do not appear to be able to form a multiple (a(n)=0) were tested out to 10000 digits added. Note those values of n for which a(n)=0 (12, 16, 24, 25, 32, 36, 48, ...) appear to be given by A064695. %e A106848 a(13) = 6 because the last digit of 13 must be appended to it six times before a new number which divides 13 is formed. (I.e., 133 mod 13 = 3, 1333 mod 13 = 7, 13333 mod 13 = 8, 133333 mod 13 = 5, 1333333 mod 13 = 6, 13333333 mod 13 = 0.) a(12)=0 because no matter how many 2's are appended to 12, the resulting number is not divisible by 12. %Y A106848 Cf. A106849. %K A106848 base,nonn %O A106848 1,11 %A A106848 Chuck Seggelin (seqfan(AT)plastereddragon.com), May 08 2005