login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161661 a(1)=1. a(n) = smallest multiple of {number of divisors of a(n-1)} that is >= n. 2
1, 2, 4, 6, 8, 8, 8, 8, 12, 12, 12, 12, 18, 18, 18, 18, 18, 18, 24, 24, 24, 24, 24, 24, 32, 30, 32, 30, 32, 30, 32, 36, 36, 36, 36, 36, 45, 42, 40, 40, 48, 50, 48, 50, 48, 50, 48, 50, 54, 56, 56, 56, 56, 56, 56, 56, 64, 63, 60, 60, 72, 72, 72 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
MATHEMATICA
t = {1}; Do[d = DivisorSigma[0, t[[-1]]]; AppendTo[t, d*Ceiling[n/d]], {n, 2, 100}]; t (* T. D. Noe, Mar 23 2011 *)
nxt[{n_, a_}]:=Module[{d=DivisorSigma[0, a]}, {n+1, d*Ceiling[(n+1)/d]}]; Transpose[ NestList[nxt, {1, 1}, 70]][[2]] (* Harvey P. Dale, Oct 14 2015 *)
CROSSREFS
Cf. A161660.
Sequence in context: A077988 A166880 A079088 * A115158 A107634 A060659
KEYWORD
nonn
AUTHOR
Leroy Quet, Jun 15 2009
EXTENSIONS
More terms from Sean A. Irvine, Mar 23 2011
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 15:17 EDT 2024. Contains 371916 sequences. (Running on oeis4.)