cp's OEIS Frontend

A114136 Numbers k such that k divides the sum of digits of all numbers from 1 to k.

%I A114136 #33 Feb 24 2024 01:13:19
%S A114136 1,3,5,7,9,18,21,24,38,58,78,98,298,498,501,537,698,702,707,711,716,
%T A114136 898,1141,1197,1501,1557,1998,2703,2706,2712,2715,3998,4502,4509,4529,
%U A114136 4536,5998,7998,8001,8097,9998,29998,36001,36297,49998,54504,54507,54510
%N A114136 Numbers k such that k divides the sum of digits of all numbers from 1 to k.
%C A114136 a(n) | A037123(a(n)). Sequence is infinite, including 10^(2m)-2 for all m >= 1. For each m >= 1, there is at least one n with A037123(a(n))/a(n) = m.
%C A114136 Number of terms < 10^m for m >= 1: 5, 12, 22, 41, 58, 79, 105, 128, 176, 202, ..., . - _Robert G. Wilson v_, Jul 06 2018
%C A114136 Certain number forms appear repeatedly: 1(9e)8, 3(9e)8, 5(9e)8, 7(9e)8, 9(9e)8, 2(9o)8, 4(9o)8, 6(9o)8, 8(9o)8; where e represents an even number of times and o an odd number of times. - _Robert G. Wilson v_, Jul 06 2018
%H A114136 Giovanni Resta, <a href="/A114136/b114136.txt">Table of n, a(n) for n = 1..320</a> (terms < 5*10^12, first 203 terms from Robert G. Wilson v)
%t A114136 lst = {}; k = 1; s = 0; While[k < 10001, If[ Mod[s += Plus @@ IntegerDigits@k, k++] == 0, AppendTo[lst, k -1]]]; lst (* _Robert G. Wilson v_, Jul 06 2018 *)
%t A114136 nxt[{t_,n_}]:={t+Total[IntegerDigits[n+1]],n+1}; Select[NestList[nxt,{1,1},55000],Divisible[#[[1]],#[[2]]]&][[All,2]] (* _Harvey P. Dale_, Jan 18 2019 *)
%o A114136 (PARI) isok(n) = (sum(k=1, n, sumdigits(k)) % n) == 0; \\ _Michel Marcus_, Jul 16 2018
%Y A114136 Cf. A037123.
%K A114136 base,nonn
%O A114136 1,2
%A A114136 _David W. Wilson_, Feb 02 2006