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”).
%I #10 May 21 2015 17:23:41
%S 1,2,6,6,30,5,35,35,35,35,385,385,5005,5005,5005,5005,85085,85085,
%T 1616615,1616615,1616615,1616615,37182145,37182145,37182145,37182145,
%U 37182145,37182145,1078282205,1078282205,33426748355,33426748355
%N a(1) = 1; for n>1, a(n) = a(n-1)*n if n is prime, a(n) = a(n-1)/n if n is composite dividing a(n-1) else a(n) = a(n-1).
%H Ivan Neretin, <a href="/A085087/b085087.txt">Table of n, a(n) for n = 1..500</a>
%F Let k be the number of members of A089581 that are <= n; then a(n) = A034386(n)/A099788(k). - _David Wasserman_, Jan 25 2005
%t a = {1}; Do[AppendTo[a, If[PrimeQ[n], 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(isprime(n), k*=n, if(k%n==0, k/=n)); print1(", "k)) \\ _Charles R Greathouse IV_, May 21 2015
%Y Cf. A034386, A089581, A099788.
%K nonn
%O 1,2
%A _Amarnath Murthy_ and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Jul 02 2003
%E More terms from _David Wasserman_, Jan 25 2005