login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100777 Square-factorial numbers: a(1) = 1, a(n+1) = a(n) * largest square divisor of (n+1). 1

%I #18 Dec 08 2020 08:35:22

%S 1,1,1,4,4,4,4,16,144,144,144,576,576,576,576,9216,9216,82944,82944,

%T 331776,331776,331776,331776,1327104,33177600,33177600,298598400,

%U 1194393600,1194393600,1194393600,1194393600,19110297600,19110297600,19110297600,19110297600

%N Square-factorial numbers: a(1) = 1, a(n+1) = a(n) * largest square divisor of (n+1).

%C Complementary to A048803 which can be defined as squarefree factorials.

%C Partial products of A008833. - _Ray Chandler_, Nov 29 2004

%H Amiram Eldar, <a href="/A100777/b100777.txt">Table of n, a(n) for n = 1..2135</a>

%t f[p_, e_] := p^(2*Floor[e/2]); s[n_] := Times @@ (f @@@ FactorInteger[n]); FoldList[Times, 1, Array[s, 31, 2]] (* _Amiram Eldar_, Dec 07 2020 *)

%Y Cf. A008833, A048803.

%K easy,nonn

%O 1,4

%A _Amarnath Murthy_, Nov 28 2004

%E More terms from _Amiram Eldar_, Dec 07 2020

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 09:11 EDT 2024. Contains 371964 sequences. (Running on oeis4.)