login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

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. 5
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

A099427(a(n)) = n + 1. - Reinhard Zumkeller, Jul 02 2011

LINKS

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

FORMULA

a(n) = n + lcm(seq(i, i=1..n)).

EXAMPLE

a(5) = 65 because 5|65, 4|64, 3|63, 2|62, 1|61 and 65 is minimal.

CROSSREFS

Rightmost diagonal of triangle in A075059. Cf. A075061, A075062.

Sequence in context: A056336 A203318 A249902 * A063981 A131095 A207813

Adjacent sequences:  A060398 A060399 A060400 * A060402 A060403 A060404

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 | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified November 24 12:07 EST 2014. Contains 249898 sequences.