cp's OEIS Frontend

A094302 a(1) = 1; if n > a(n-1) then a(n) = n*a(n-1) else a(n) = least integer multiple of a(n-1)/n.

%I A094302 #8 Mar 22 2018 18:06:43
%S A094302 1,2,6,3,15,5,35,35,35,7,77,77,77,11,165,165,165,55,55,11,231,21,483,
%T A094302 161,161,161,161,23,667,667,667,667,667,667,667,667,667,667,667,667,
%U A094302 667,667,667,667,667,29,1363,1363,1363,1363,1363,1363,1363,1363,1363,1363
%N A094302 a(1) = 1; if n > a(n-1) then a(n) = n*a(n-1) else a(n) = least integer multiple of a(n-1)/n.
%H A094302 Ivan Neretin, <a href="/A094302/b094302.txt">Table of n, a(n) for n = 1..10000</a>
%e A094302 a(16) = 165, 17 < 165, so a(17) = (least integer multiple of 165/17) = 165.
%t A094302 FoldList[If[#2 > #1, #1*#2, Numerator[#1/#2]] &, 1, Range[2, 56]] (* _Ivan Neretin_, Mar 21 2018 *)
%o A094302 (PARI) q=1;for(n=2,57,print1(q,",");q=if(n>q,q*n,q/gcd(q,n)))
%Y A094302 Cf. A094299, A055773.
%K A094302 nonn,easy
%O A094302 1,2
%A A094302 _Amarnath Murthy_, Apr 29 2004
%E A094302 Edited by _Klaus Brockhaus_, May 02 2004