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 A331096 #26 Sep 08 2022 08:46:24 %S A331096 20,66,138,174,246,282,318,354,426,534,606,642,822,1038,1074,1146, %T A331096 1182,1362,1434,1506,1542,1614,1902,2082,2118,2154,2334,2406,2514, %U A331096 2802,3018,3054,3126,3342,3414,3522,3702,4062,4206,4314,5034,5142,5322,6114,7122,7232,7302,8202 %N A331096 Numbers k such that the sum of all divisors except k, minus the sum of the digits of k, is equal to k. %C A331096 The first two odd elements are a(49) = 8415 and a(107) = 31815.- _Robert Israel_, Jan 16 2020 %H A331096 Robert Israel, <a href="/A331096/b331096.txt">Table of n, a(n) for n = 1..1400</a> %p A331096 filter:= proc(k) numtheory:-sigma(k)-convert(convert(k,base,10),`+`)=2*k end proc: %p A331096 select(filter, [$1..10000]); # _Robert Israel_, Jan 16 2020 %t A331096 Select[Range[10^4], DivisorSigma[1, #] - Plus @@ IntegerDigits[#] == 2 # &] (* _Amiram Eldar_, Jan 11 2020 *) %o A331096 (PARI) isok(k) = sigma(k) - k - sumdigits(k) == k; \\ _Michel Marcus_, Jan 11 2020 %o A331096 (Magma) [k:k in [1..8250]| DivisorSigma(1,k) eq 2*k+&+Intseq(k)]; // _Marius A. Burtea_, Jan 11 2020 %Y A331096 Cf. A007953 (sum of digits), A001065 (sum of proper divisors). %Y A331096 Related sequences are A331037 and A331093. %K A331096 nonn,base,less %O A331096 1,1 %A A331096 _Joseph E. Marrow_, Jan 08 2020