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 A226024 #23 Aug 29 2025 11:10:50 %S A226024 10,13,15,18,20,21,22,23,24,25,26,27,28,32,34,37,38 %N A226024 Integers k such that (sum of digits of 10234*k) = k. %C A226024 Inspired by Carmine Suriano's comment in A113315. %C A226024 Proof that 38 is the highest value: 10234*38=388892 has 6 digits. Maximum value of digitsum for a 6-digit numer is 54. Direct inspection of digitsum of 10234*39=399126 through 10234*54=552637 shows that no other solution exists. For numbers 55 through 97, direct inspection shows that no other solution exists either. For n>97, the number has 7 digits, having 63 as its maximum digitsum; therefore, no solution exists for any number >97. - _Carmine Suriano_, Sep 23 2013 %e A226024 A007953(10234*n) = n. %Y A226024 Cf. A005349, A007953, A113315. %K A226024 base,nonn,fini,full,changed %O A226024 1,1 %A A226024 _Zak Seidov_, May 23 2013