cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A084744 Product of all composite numbers from 1 to the n-th nonprime number divided by product of all the prime divisors of each of those composite numbers which exceed the previously stated value.

This page as a plain text file.
%I A084744 #18 Jun 23 2025 10:24:48
%S A084744 1,2,8,24,48,384,1152,2304,9216,46080,414720,829440,13271040,79626240,
%T A084744 318504960,637009920,1911029760,15288238080,107017666560,535088332800,
%U A084744 1070176665600,9631589990400,38526359961600,77052719923200
%N A084744 Product of all composite numbers from 1 to the n-th nonprime number divided by product of all the prime divisors of each of those composite numbers which exceed the previously stated value.
%C A084744 More precisely the denominator equals the product of the largest squarefree divisors of composite numbers up to n.
%F A084744 a(1)=1, a(n) = a(n-1)*n/(n's prime factors).
%e A084744 a(4) = (1*4*6*8*9)/((2)*(2*3)*(2)*(3)) = 24.
%p A084744 A084744 := proc(n) sort(convert(convert(A085056(n),set),list)) end: # _Peter Luschny_, Jun 29 2009
%t A084744 PrimeFactors[ n_Integer ] := Flatten[ Table[ # [ [ 1 ] ], {1} ] & /@ FactorInteger[ n ] ]; a[ 1 ] := 1; a[ n_ ] := a[ n ] = a[ n - 1 ]*n / Times @@ PrimeFactors[ n ]; Union[ Table[ a[ n ], {n, 1, 63} ] ]
%Y A084744 Cf. A085056.
%K A084744 nonn
%O A084744 1,2
%A A084744 _Amarnath Murthy_ and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Jun 26 2003
%E A084744 Edited and extended by _Robert G. Wilson v_, Jun 27 2003