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 A052887 #70 Jan 11 2025 12:53:53
%S A052887 1,0,2,12,84,720,7320,85680,1130640,16571520,266747040,4673592000,
%T A052887 88476252480,1798674958080,39061703640960,902110060051200,
%U A052887 22068313153286400,569874634276147200,15486794507222438400,441703937156940057600,13189422568491333964800,411420697666247453184000
%N A052887 Expansion of e.g.f.: exp(x^2/(1 - x)^2).
%C A052887 Previous name was: A simple grammar.
%C A052887 For n>=2, a(n) is the number of ways to partition {1,2,...,n} into any number of blocks. Then partition each block into exactly 2 subblocks. Then form ordered pairs by permuting the elements within each pair of subblocks. - _Geoffrey Critzer_, Jun 13 2020
%H A052887 Seiichi Manyama, <a href="/A052887/b052887.txt">Table of n, a(n) for n = 0..433</a>
%H A052887 INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=860">Encyclopedia of Combinatorial Structures 860</a>
%F A052887 E.g.f.: exp(x^2/(1 - x)^2).
%F A052887 Recurrence: a(0) = 1, a(1) = 0, a(2) = 2, and for n >= 2, (-n^3-2*n-3*n^2)*a(n) +(3*n^2+7*n+2)*a(n+1) + (-6-3*n)*a(n+2) + a(n+3) = 0.
%F A052887 a(n) = Sum_{k=0..floor(n/2)} n!/k!*binomial(n-1, 2*k-1). - _Vladeta Jovovic_, Sep 13 2003
%F A052887 a(n) ~ 2^(1/6)* n^(n-1/6) * exp(1/3 - (n/2)^(1/3) + 3*(n/2)^(2/3) - n)/sqrt(3) * (1 - 14*2^(-2/3)/(27*n^(1/3)) - 1688*2^(-4/3)/(3645*n^(2/3))). - _Vaclav Kotesovec_, Oct 01 2013
%F A052887 a(n) = n!*y(n) with y(0) = 1 and y(n) = Sum_{k=0..n-1} (n-k)*(n-k-1)*y(k)/n for n >= 1. - _Benedict W. J. Irwin_, Jun 02 2016
%e A052887 a(3) = 12 because we have the 6 ordered pairs: ({1},{2,3}), ({1},{3,2}), ({2},{1,3}), ({2},{3,1}), ({3},{1,2}), ({3},{2,1}) and their reflections. - _Geoffrey Critzer_, Jun 13 2020
%p A052887 spec := [S,{B=Sequence(Z,1 <= card),C=Prod(B,B),S= Set(C)},labeled]: seq(combstruct[count](spec,size=n), n=0..20);
%t A052887 nn = 20; a = x/(1 - x); Range[0, nn]! CoefficientList[Series[Exp[ a^2], {x, 0, nn}], x] (* _Geoffrey Critzer_, Dec 11 2011 *)
%o A052887 (Maxima) makelist(if n=0 then 1 else sum(n!/k!*binomial(n-1, 2*k-1), k, 0, floor(n/2)), n, 0, 18); /* _Bruno Berselli_, May 25 2011 */
%o A052887 (PARI)
%o A052887 N=33; x='x+O('x^N);
%o A052887 egf=exp(x^2/(1-x)^2);
%o A052887 Vec(serlaplace(egf))
%o A052887 /* _Joerg Arndt_, Sep 15 2012 */
%K A052887 easy,nonn
%O A052887 0,3
%A A052887 encyclopedia(AT)pommard.inria.fr, Jan 25 2000
%E A052887 New name using e.g.f. from _Vaclav Kotesovec_, Oct 01 2013
%E A052887 Formula section edited by _Petros Hadjicostas_, Jun 12 2020