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!)
A161660 a(1)=1; a(n) = largest multiple of {number of divisors of a(n-1)} that is <= n. 1
1, 2, 2, 4, 3, 6, 4, 6, 8, 8, 8, 12, 12, 12, 12, 12, 12, 18, 18, 18, 18, 18, 18, 24, 24, 24, 24, 24, 24, 24, 24, 32, 30, 32, 30, 32, 36, 36, 36, 36, 36, 36, 36, 36, 45, 42, 40, 48, 40, 48, 50, 48, 50, 54, 48, 50, 54, 56, 56, 56, 56, 56, 56, 64, 63, 66, 64, 63, 66, 64, 70, 72, 72 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
a(18)=18 because a(17)=12 has 6 divisors and the largest multiple of 6 not exceeding 18 is 18. - Emeric Deutsch, Jun 27 2009
MAPLE
with(numtheory): a[1] := 1: for n from 2 to 80 do for j while j*tau(a[n-1]) <= n do end do: a[n] := (j-1)*tau(a[n-1]) end do: seq(a[n], n = 1 .. 80); # Emeric Deutsch, Jun 27 2009
CROSSREFS
Cf. A161661.
Sequence in context: A302043 A060681 A202479 * A343327 A060766 A321015
KEYWORD
nonn
AUTHOR
Leroy Quet, Jun 15 2009
EXTENSIONS
Extended by Emeric Deutsch, Jun 27 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 April 18 08:27 EDT 2024. Contains 371769 sequences. (Running on oeis4.)