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 A323415 #6 Jan 13 2019 19:30:46 %S A323415 1,14,84,120,1180,1450,10180,12784,100180,101180,114500,139204, %T A323415 1100180,10000180,10010180,10111180,11000180,85937220,101011180, %U A323415 101101180,101110180,101111180,110000180,111001180,111100180,111101180,111110180 %N A323415 Numbers equal to the carryless sum of their divisors. %C A323415 Equivalently, numbers k such that A323394(k) = k. %H A323415 <a href="/index/Ca#CARRYLESS">Index entries for sequences related to carryless arithmetic</a> %e A323415 For k = 14: %e A323415 - the divisors of 14 are: 1, 2, 7, 14, %e A323415 - the sum of the units are: 1 + 2 + 7 + 4 = 14 == 4 (mod 10), %e A323415 - the sum of the tens are: 1, %e A323415 - hence A323394(14) = 14 and 14 belongs to the sequence. %o A323415 (PARI) isok(n, base=10) = my (v=[]); fordiv (n, d, my (w=Vecrev(digits(d, base))); v=vector(max(#v, #w), k, (if (k>#v, w[k], k>#w, v[k], (v[k]+w[k])%base)))); fromdigits(Vecrev(v), base)==n %Y A323415 Cf. A323394. %K A323415 nonn,base %O A323415 1,2 %A A323415 _Rémy Sigrist_, Jan 13 2019