The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A058198 Where d(m) (number of divisors, A000005) has risen by at least n. 4
 2, 6, 12, 12, 24, 24, 48, 48, 60, 60, 120, 120, 168, 168, 180, 180, 240, 240, 360, 360, 360, 360, 720, 720, 720, 720, 720, 720, 840, 840, 1260, 1260, 1260, 1260, 1680, 1680, 2520, 2520, 2520, 2520, 2520, 2520, 2520, 2520, 3360, 3360, 5040, 5040, 5040, 5040 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 REFERENCES D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, 1996, Section II.1.3.a. LINKS T. D. Noe, Table of n, a(n) for n = 1..1004 EXAMPLE d(11)=2, d(12)=6 gives first jump of >= 3, so a(3) = a(4) = 12. PROG (Haskell) a058198 = (+ 1) . a058197  -- Reinhard Zumkeller, Feb 04 2013 CROSSREFS Equals A058197(n) + 1. Cf. A058199. Sequence in context: A074385 A057340 A092427 * A096075 A278256 A066791 Adjacent sequences:  A058195 A058196 A058197 * A058199 A058200 A058201 KEYWORD nonn,nice,easy AUTHOR N. J. A. Sloane, Nov 28 2000 EXTENSIONS More terms from James A. Sellers, Nov 29 2000 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 16 07:16 EDT 2021. Contains 347469 sequences. (Running on oeis4.)