|
%I #24 Mar 15 2018 04:11:29
%S 2,5,11,11,59,59,419,839,2519,2519,27719,27719,360359,360359,360359,
%T 720719,12252239,12252239,232792559,232792559,232792559,232792559,
%U 5354228879,5354228879,26771144399,26771144399,80313433199,80313433199,2329089562799,2329089562799
%N Final term of n-th row of triangle in A079784.
%C For n >= 4, a(n) = A003418(n) - 1. Also for n < 4, a(n) is the smallest number congruent to (i-1) (mod i) for any i in {1..n}. That results directly from the definition of A003418 (if p == 0 (mod q), p-1 == (q-1) (mod q)) and from the first comment. - Philippe LALLOUET (philip.lallouet(AT)wanadoo.fr), Aug 29 2007
%e a(4) = lcm(1, 2, 3, 4) - 1 = 12 - 1 = 11. a(5) = lcm(1, 2, 3, 4, 5) - 1 = 60 - 1 = 59. - _Michael Somos_, Feb 28 2014
%p A079782 := proc(n) local a,found,r ; a := n+1 ; while true do found := true ; for r from 1 to n do if (a+r-1) mod (n-r+1) <> 0 then found := false ; break ; fi ; od ; if found then RETURN(a+n-1) ; fi ; a :=a+1 ; od ; end: for n from 1 to 20 do print(A079782(n)) ; od ; # _R. J. Mathar_, Nov 12 2006
%o (PARI) okrow(m, n) = {v = vector(n, i, i+m-1); for (i=1, n, if (v[i] % (n-i+1), return (0));); return (1);}
%o a(n) = {m = n+1; while (! okrow(m, n), m++); m+n-1;} \\ _Michel Marcus_, Feb 28 2014
%Y Cf. A079781, A079783, A079784.
%K nonn
%O 1,1
%A _Amarnath Murthy_, Feb 03 2003
%E More terms from _R. J. Mathar_, Nov 12 2006
%E More terms from _Michel Marcus_, Feb 28 2014
|
