The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A060401 a(n) = minimal m such that m>n, n divides m, n-1 divides m-1, n-2 divides m-2 and so on down to 1 divides m-n+1. 6
2, 4, 9, 16, 65, 66, 427, 848, 2529, 2530, 27731, 27732, 360373, 360374, 360375, 720736, 12252257, 12252258, 232792579, 232792580, 232792581, 232792582, 5354228903, 5354228904, 26771144425, 26771144426, 80313433227, 80313433228, 2329089562829, 2329089562830 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
A099427(a(n)) = n + 1. - Reinhard Zumkeller, Jul 02 2011
LINKS
FORMULA
a(n) = n + lcm(seq(i, i=1..n)).
a(n) = n + A003418(n). - Robert Israel, Jul 19 2016
EXAMPLE
a(5) = 65 because 5|65, 4|64, 3|63, 2|62, 1|61 and 65 is minimal.
MAPLE
seq(n+ilcm($1..n), n=1..100); # Robert Israel, Jul 19 2016
CROSSREFS
Rightmost diagonal of triangle in A075059. Cf. A075061, A075062.
Cf. A003418.
Sequence in context: A283081 A344265 A249902 * A063981 A131095 A207813
KEYWORD
nonn
AUTHOR
Christopher Burrows (cburrows(AT)math.upenn.edu), Apr 04 2001
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 May 19 14:35 EDT 2024. Contains 372698 sequences. (Running on oeis4.)