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 A216405 #51 Jul 22 2025 23:31:37 %S A216405 1,142813628717821,253323932621811,1234954171531131,1713763544613181, %T A216405 3713154346661821,5953112416611411,8711631351783421,11853531183574141, %U A216405 12191214257422251,17137635446131261,19941476493818971,21342541323383331,25628491758925521,28665872459864731 %N A216405 Numbers which start a run of nine consecutive zero-digit-free decimal integers, each of which is divisible by the sum of its digits. %C A216405 Each term of the sequence ends with the digit 1. %C A216405 No run of ten consecutive zero-digit-free decimal integers is possible. %e A216405 The numbers from a(2)=142813628717821 to 142813628717829 are each divisible by their digit sums, which are 61 to 69 respectively. %o A216405 (PARI) \\ Algorithm from Jack Brennen %o A216405 list(lim)=my(v=List([1]),m); forstep(d=11, (40320*lim)^(1/9), 10, m=lcm(vector(9,k,d+k-1)); forstep(x=m+d, lim, m, if(sumdigits(x)==d && vecsort(digits(x))[1], listput(v,x)))); vecsort(Vec(v)) \\ _Charles R Greathouse IV_, Oct 16 2012 %Y A216405 Subsequence of A217973 and of A017281. %K A216405 nonn,base %O A216405 1,2 %A A216405 _Jack Brennen_, Oct 16 2012