login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(1) = 1. a(n) = n*a(n-1) if gcd(n,a(n-1)) = 1, a(n-1)/n if n divides a(n-1), otherwise a(n) = a(n-1).
2

%I #15 Oct 20 2019 01:55:54

%S 1,2,6,6,30,5,35,280,2520,252,2772,231,3003,3003,3003,48048,816816,

%T 816816,15519504,15519504,739024,33592,772616,772616,19315400,742900,

%U 20058300,20058300,581690700,19389690,601080390,601080390

%N a(1) = 1. a(n) = n*a(n-1) if gcd(n,a(n-1)) = 1, a(n-1)/n if n divides a(n-1), otherwise a(n) = a(n-1).

%C The sequence can also be obtained by taking a(1) = 1 and then multiplying the previous term by n if n is coprime to the previous term a(n-1), dividing the previous term by n if n divides the previous term a(n-1), taking a(n) = a(n-1) if n is unrelated to a(n-1). - _Amarnath Murthy_, Oct 30 2002 (corrected by _Franklin T. Adams-Watters_, Dec 13 2006)

%H Ivan Neretin, <a href="/A068629/b068629.txt">Table of n, a(n) for n = 1..1000</a>

%t a = {1}; Do[AppendTo[a, If[GCD[a[[-1]], n] == 1, a[[-1]]*n, If[Divisible[a[[-1]], n], a[[-1]]/n, a[[-1]]]]], {n, 2, 32}]; a (* _Ivan Neretin_, May 21 2015 *)

%o (PARI) print1(k=1); for(n=2,99, if(gcd(k,n)==1, k*=n, if(k%n==0, k/=n)); print1(", "k)) \\ _Charles R Greathouse IV_, May 21 2015

%Y Cf. A034386, A068626, A068627, A068628.

%K easy,nonn

%O 1,2

%A _Amarnath Murthy_, Feb 26 2002

%E a(26)-a(32) corrected by _Ivan Neretin_, May 21 2015