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.

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

This page as a plain text file.
%I A100777 #18 Dec 08 2020 08:35:22
%S A100777 1,1,1,4,4,4,4,16,144,144,144,576,576,576,576,9216,9216,82944,82944,
%T A100777 331776,331776,331776,331776,1327104,33177600,33177600,298598400,
%U A100777 1194393600,1194393600,1194393600,1194393600,19110297600,19110297600,19110297600,19110297600
%N A100777 Square-factorial numbers: a(1) = 1, a(n+1) = a(n) * largest square divisor of (n+1).
%C A100777 Complementary to A048803 which can be defined as squarefree factorials.
%C A100777 Partial products of A008833. - _Ray Chandler_, Nov 29 2004
%H A100777 Amiram Eldar, <a href="/A100777/b100777.txt">Table of n, a(n) for n = 1..2135</a>
%t A100777 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 A100777 Cf. A008833, A048803.
%K A100777 easy,nonn
%O A100777 1,4
%A A100777 _Amarnath Murthy_, Nov 28 2004
%E A100777 More terms from _Amiram Eldar_, Dec 07 2020