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!)
A161578 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. 2
2, 3, 5, 7, 11, 13, 17, 19, 23, 25, 29, 31, 37, 38, 39, 41, 43, 44, 47, 49, 51, 53, 59, 61, 67, 69, 71, 73, 79, 81, 83, 85, 86, 87, 89, 91, 97, 101, 103, 104, 107, 109, 113, 115, 116, 118, 127, 128, 131, 133, 134, 137, 139, 141, 142, 143, 145 (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
CROSSREFS
Sequence in context: A352584 A038179 A192489 * A261271 A335284 A308966
KEYWORD
nonn
AUTHOR
Leroy Quet, Jun 14 2009
EXTENSIONS
More terms from Sean A. Irvine, Feb 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 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)