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!)
A161577 a(1)=2. a(n) = the smallest integer > a(n-1) such that d(a(n)) >= d(n), where d(n) = the number of divisors of n. 3
2, 3, 4, 6, 7, 8, 9, 10, 12, 14, 15, 18, 19, 20, 21, 24, 25, 28, 29, 30, 32, 33, 34, 36, 38, 39, 40, 42, 43, 48, 49, 50, 51, 52, 54, 60, 61, 62, 63, 66, 67, 70, 71, 72, 75, 76, 77, 80, 81, 84, 85, 88, 89, 90, 91, 96, 98, 99, 100, 108, 109, 110, 112, 114, 115, 120, 121, 124, 125 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Starting the sequence with a(1)=1 instead would have lead to a(n) = n for all n, obviously.
LINKS
MATHEMATICA
nxt[{n_, a_}]:=Module[{k=a+1, d=DivisorSigma[0, n+1]}, While[DivisorSigma[0, k]<d, k++]; {n+1, k}]; NestList[nxt, {1, 2}, 80][[All, 2]] (* Harvey P. Dale, Aug 30 2017 *)
CROSSREFS
Sequence in context: A296858 A296241 A070932 * A358330 A093686 A325031
KEYWORD
nonn
AUTHOR
Leroy Quet, Jun 14 2009
EXTENSIONS
Extended beyond 20 by R. J. Mathar, Oct 24 2009
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 March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)