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 A144364 #11 Jun 30 2025 10:18:02
%S A144364 1,11,31,53,331,377,983,1499,2609,3329,6637,6997,19937,34987,157961,
%T A144364 173699,256661,1349923,1616359,1993333,2199833,5794969,6906869,
%U A144364 12204431,14223073,20666551,168499997,4819002127,7331752277,8259275501,27017515331,27581017543
%N A144364 Where records occur in A144261.
%H A144364 Amiram Eldar, <a href="/A144364/b144364.txt">Table of n, a(n) for n = 1..39</a>
%t A144364 f[n_] := Module[{k = 1, m = n}, While[!Divisible[m, DigitSum[m]], m +=n; k++]; k]; seq[lim_] := Module[{s = {}, fm = 0, fi}, Do[fi = f[i]; If[fi > fm, fm = fi; AppendTo[s, i]], {i, 1, lim}]; s]; seq[10^5] (* _Amiram Eldar_, Jun 30 2025 *)
%o A144364 (PARI) f(n) = {my(k = 1, m = n); while(m % sumdigits(m), m +=n; k++); k;}
%o A144364 list(lim) = my(fm = 0, fi); for(i = 1, lim, fi = f(i); if(fi > fm, fm = fi; print1(i, ", "))); \\ _Amiram Eldar_, Jun 30 2025
%Y A144364 Cf. A005349 (Niven numbers), A144261 (smallest k such that k*n is a Niven number), A144363 (records in A144261).
%K A144364 base,nonn
%O A144364 1,2
%A A144364 _Klaus Brockhaus_, Sep 19 2008
%E A144364 a(27)-a(30) from _Donovan Johnson_, Jul 20 2010
%E A144364 a(31)-a(32) from _Amiram Eldar_, Jun 30 2025