cp's OEIS Frontend

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.

%I A060401 #16 Jul 19 2016 18:52:06
%S A060401 2,4,9,16,65,66,427,848,2529,2530,27731,27732,360373,360374,360375,
%T A060401 720736,12252257,12252258,232792579,232792580,232792581,232792582,
%U A060401 5354228903,5354228904,26771144425,26771144426,80313433227,80313433228,2329089562829,2329089562830
%N 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.
%C A060401 A099427(a(n)) = n + 1. - _Reinhard Zumkeller_, Jul 02 2011
%H A060401 Robert Israel, <a href="/A060401/b060401.txt">Table of n, a(n) for n = 1..2296</a>
%F A060401 a(n) = n + lcm(seq(i, i=1..n)).
%F A060401 a(n) = n + A003418(n). - _Robert Israel_, Jul 19 2016
%e A060401 a(5) = 65 because 5|65, 4|64, 3|63, 2|62, 1|61 and 65 is minimal.
%p A060401 seq(n+ilcm($1..n),n=1..100); # _Robert Israel_, Jul 19 2016
%Y A060401 Rightmost diagonal of triangle in A075059. Cf. A075061, A075062.
%Y A060401 Cf. A003418.
%K A060401 nonn
%O A060401 1,1
%A A060401 Christopher Burrows (cburrows(AT)math.upenn.edu), Apr 04 2001