|
%I M2853 N1147 #58 Sep 08 2022 08:44:28
%S 1,1,3,10,38,156,692,3256,16200,84496,460592,2611104,15355232,
%T 93376960,585989952,3786534784,25152768128,171474649344,1198143415040,
%U 8569374206464,62668198184448,468111364627456,3568287053001728
%N Expansion of e.g.f. (1/2)*(exp(2*x + x^2) + 1).
%C Number of solutions to the rook problem on a 2n X 2n board having a certain symmetry group (see Robinson for details).
%C One more than the number of ordered pairs of minimally intersecting partitions such that p consists of exactly two blocks.
%C The number of B-orbits in the symmetric space of type DIII, SO_{2n}(C)/GL_n(C) where B is a Borel subgroup of SO_{2n}(C). These are parameterized by "type DIII (n,n)-clans". E.g., for n=2, the a(2)=3 type DIII (2,2)-clans are ++--, --++, and 1212. See [Bingham and Ugurlu] link. - _Aram Bingham_, Feb 08 2020
%D L. C. Larson, The number of essentially different nonattacking rook arrangements, J. Recreat. Math., 7 (No. 3, 1974), circa pages 180-181.
%D R. W. Robinson, Counting arrangements of bishops, pp. 198-214 of Combinatorial Mathematics IV (Adelaide 1975), Lect. Notes Math., 560 (1976).
%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H T. D. Noe, <a href="/A000902/b000902.txt">Table of n, a(n) for n=0..200</a>
%H Aram Bingham, Özlem Uğurlu, <a href="https://arxiv.org/abs/1907.08875">Sects, rooks, pyramids, partitions and paths for type DIII clans</a>, arXiv:1907.08875 [math.CO], 2019.
%H Aram Bingham and Özlem Uğurlu, <a href="https://ajc.maths.uq.edu.au/pdf/79/ajc_v79_p055.pdf">DIII clan combinatorics for the orthogonal Grassmannian</a>, Australasian J. of Combinatorics (2021) Vol. 79, No. 1, 55-86.
%H L. C. Larson, <a href="/A000900/a000900_1.pdf">The number of essentially different nonattacking rook arrangements</a>, J. Recreat. Math., 7 (No. 3, 1974), circa pages 180-181. [Annotated scan of pages 180 and 181 only]
%H E. Lucas, <a href="http://gallica.bnf.fr/ark:/12148/bpt6k29021h">Théorie des Nombres</a>, Gauthier-Villars, Paris, 1891, Vol. 1, p. 222.
%H E. Lucas, <a href="/A000899/a000899.pdf">Théorie des nombres</a> (annotated scans of a few selected pages)
%H B. Pittel, <a href="http://www.combinatorics.org">Where the typical set partitions meet and join</a>, Electron. J. of Combin. 7, R5.
%H R. W. Robinson, <a href="/A000899/a000899_1.pdf">Counting arrangements of bishops</a>, pp. 198-214 of Combinatorial Mathematics IV (Adelaide 1975), Lect. Notes Math., 560 (1976). (Annotated scanned copy)
%F a(n) = 2*a(n-1) + (2n-2)*a(n-2) for n >= 3. - _N. J. A. Sloane_, Sep 23 2006
%F a(n) = 1 + n!/(2e) * [x^n] Sum[l>=0, 1/l! * {(1+x)^l-1}^2].
%F For asymptotics see the Robinson paper.
%F But the asymptotic formula in the Robinson paper is wrong (see A000898, discussion from Oct 01 2013). - _Vaclav Kotesovec_, Aug 04 2014
%F a(n) ~ 2^(n/2-3/2) * n^(n/2) * exp(sqrt(2*n)-n/2-1/2). - _Vaclav Kotesovec_, Aug 04 2014
%F a(n) = (i/2)^(1 - n)*KummerU((1 - n)/2, 3/2, -1)) for n>=1. - _Peter Luschny_, Nov 29 2017
%F a(n) = Sum_{r=0..floor(n/2)} 2^(n-2r-1) * {(n!)/(r!(n-2r)!)}. - _Aram Bingham_, Feb 08 2020
%p # Comment from the authors: For Maple program see A000903.
%p A000902 := n -> `if`(n=0, 1, I^(-n)*orthopoly[H](n, I)/2):
%p seq(A000902(n), n=0..22); # _Peter Luschny_, Nov 29 2017
%t n = 22; CoefficientList[ Series[(1/2)*(Exp[2*x+x^2] + 1), {x, 0, n}], x] * Table[k!, {k, 0, n}]
%t (* _Jean-François Alcover_, May 18 2011 *)
%o (Haskell)
%o a000902 n = a000902_list !! n
%o a000902_list = 1 : 1 : 3 : map (* 2) (zipWith (+)
%o (drop 2 a000902_list) (zipWith (*) [2..] $ tail a000902_list))
%o -- _Reinhard Zumkeller_, Sep 10 2013
%o (Magma) a:=[1,3]; [1] cat [n le 2 select a[n] else 2*Self(n-1) + (2*n-2)*Self(n-2):n in [1..22]]; // _Marius A. Burtea_, Feb 12 2020
%Y Equals 1/2 * A000898(n) for n>0.
%K nonn,easy,nice
%O 0,3
%A _N. J. A. Sloane_, _Simon Plouffe_
| 