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 A331093 #22 Jan 14 2020 07:23:34 %S A331093 12,114256,6988996,8499988,8689996,8789788,8877988,8988868,8999956, %T A331093 9696988,9759988,9899596,9948988,9996868,9998884,9999892,15996988, %U A331093 16878988,17799796,17887996,17988796,17999884,18579988,18768988,18869788,18895996,18958996,18995788,19398988,19587988,19698868,19777996,19799668 %N A331093 Numbers such that the sum of their divisors, excluding 1 and the number itself, minus the sum of their digits equals the number. %C A331093 After the second term, it seems that the digit sum is 55. %C A331093 All terms after a(2) appear to be of the form 2^2 * 7 * p, where p is a prime. - _Scott R. Shannon_, Jan 09 2020 %C A331093 If there exists a third term not of the form 2^2*7*p, it is larger than 10^13. - _Giovanni Resta_, Jan 14 2020 %e A331093 a(3) = 6988996 as the sum of the divisors of 6988996, excluding 1 and 6988996, equals 6989051, the sum of its digits equals 55, and 6989051 - 55 = 6988996. %t A331093 Select[Range[10^7], DivisorSigma[1, #] - Plus @@ IntegerDigits[#] == 2 # + 1 &] (* _Amiram Eldar_, Jan 08 2020 *) %o A331093 (PARI) isok(n) = sigma(n) - n - 1 - sumdigits(n) == n; \\ _Michel Marcus_, Jan 09 2020 %Y A331093 Cf. A000203, A007953, A048050. %Y A331093 Cf. A331037 (sum of divisors + digit sum = number). %K A331093 nonn,base,less %O A331093 1,1 %A A331093 _Joseph E. Marrow_, Jan 08 2020 %E A331093 Terms a(7) and beyond from _Scott R. Shannon_, Jan 09 2020