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!)
A164528 a(1)=2. a(n) = the smallest multiple of {the largest proper divisor of n} that is > a(n-1). 1
2, 3, 4, 6, 7, 9, 10, 12, 15, 20, 21, 24, 25, 28, 30, 32, 33, 36, 37, 40, 42, 44, 45, 48, 50, 52, 54, 56, 57, 60, 61, 64, 66, 68, 70, 72, 73, 76, 78, 80, 81, 84, 85, 88, 90, 92, 93, 96, 98, 100, 102, 104, 105, 108, 110, 112, 114, 116, 117, 120, 121, 124, 126, 128, 130, 132 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

If a(1) equaled 1 instead, we would instead have a(n) = n for all n, of course.

LINKS

Table of n, a(n) for n=1..66.

CROSSREFS

Cf. A032742, A164529.

Sequence in context: A006254 A111333 A047701 * A127963 A031403 A189578

Adjacent sequences:  A164525 A164526 A164527 * A164529 A164530 A164531

KEYWORD

nonn

AUTHOR

Leroy Quet, Aug 15 2009

EXTENSIONS

Extended by Ray Chandler, Mar 15 2010

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 June 27 11:25 EDT 2022. Contains 354896 sequences. (Running on oeis4.)