|
%I #35 Apr 13 2024 05:17:35
%S 4,6,12,12,24,30,36,60,60,60,120,120,120,180,180,180,240,240,360,360,
%T 360,420,720,720,720,720,840,840,840,1260,1260,1260,1680,1680,1680,
%U 1680,1680,2160,2520,2520,2520,2520,2520,2520,2520,2520,5040,5040,5040
%N Where d(m) (number of divisors, A000005) falls by at least n.
%C In the first 500 entries, only 3 entries (1, 2, and 25200) of A002182 are missed. - _Bill McEachen_, Nov 05 2020
%C a(n) exists for all n (Turán, 1954). - _Amiram Eldar_, Apr 13 2024
%D József Sándor, Dragoslav S. Mitrinovic, and Borislav Crstici, Handbook of Number Theory I, Springer Science & Business Media, 2005, Chapter II, p. 39, section II.1.3.a.
%H Amiram Eldar, <a href="/A058199/b058199.txt">Table of n, a(n) for n = 1..2014</a> (terms 1..500 from T. D. Noe)
%H Pál Turán, Problem 71, Matematikai Lapok, Vol. 5 (1954), p. 48, <a href="https://real-j.mtak.hu/9380">entire volume</a>; Solution to Problem 71, by Lajos Takács, ibid., Vol. 56, (1956), p. 154, <a href="https://real-j.mtak.hu/9386">entire volume</a>.
%F A051950(a(n) + 1) <= - n. - _Reinhard Zumkeller_, Feb 04 2013
%e d(12) = 6, d(13) = 2 gives first drop of >= 3, so a(3) = a(4) = 12.
%t max = 10^4; dd = Differences[Table[DivisorSigma[0, m], {m, 1, max}]]; a[n_] := Position[dd, d_ /; d <= -n, 1, 1][[1, 1]]; Table[a[n], {n, 1, -Min[dd] }] (* _Jean-François Alcover_, Nov 23 2015 *)
%o (Haskell)
%o import Data.List (findIndex)
%o import Data.Maybe (fromJust)
%o a058199 n = fromJust $ findIndex (n <=) $ map negate a051950_list
%o -- _Reinhard Zumkeller_, Feb 04 2013
%Y Cf. A000005, A002182, A051950, A058197, A058198.
%K nonn,nice,easy
%O 1,1
%A _N. J. A. Sloane_, Nov 28 2000
%E More terms from _James A. Sellers_, Nov 29 2000
|
