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.
%I A052577 #18 Jun 03 2022 19:17:04
%S A052577 1,4,26,240,2904,43680,786960,16531200,396789120,10713669120,
%T A052577 321413702400,10606692096000,381841394457600,14891820610867200,
%U A052577 625456552834713600,28145546185236480000,1350986237814140928000,68900298484208615424000,3720616124549638938624000
%N A052577 a(n) = (3^(n+1)-1)*n!/2.
%H A052577 INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=520">Encyclopedia of Combinatorial Structures 520</a>
%F A052577 E.g.f.: 1/(-1+x)/(-1+3*x).
%F A052577 Recurrence: {a(0)=1, a(1)=4, (3*n^2+9*n+6)*a(n)+(-4*n-8)*a(n+1)+a(n+2)=0.}.
%F A052577 a(n) = (-1/2+1/2*3^(n+1))*n!.
%F A052577 a(n)=n!*A003462(n+1). - _R. J. Mathar_, Jun 03 2022
%p A052577 spec := [S,{S=Prod(Sequence(Z),Sequence(Union(Z,Z,Z)))},labeled]: seq(combstruct[count](spec,size=n), n=0..20);
%K A052577 easy,nonn
%O A052577 0,2
%A A052577 encyclopedia(AT)pommard.inria.fr, Jan 25 2000