cp's OEIS Frontend

A006088 a(n) = (2^n + 2) a(n-1) (kissing number of Barnes-Wall lattice in dimension 2^n).

%I A006088 M3606 #46 Sep 08 2022 08:44:34
%S A006088 1,4,24,240,4320,146880,9694080,1260230400,325139443200,
%T A006088 167121673804800,171466837323724800,351507016513635840000,
%U A006088 1440475753672879672320000,11803258325595576034990080000,193408190923209108909347450880000
%N A006088 a(n) = (2^n + 2) a(n-1) (kissing number of Barnes-Wall lattice in dimension 2^n).
%D A006088 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A006088 J. H. Conway and N. J. A. Sloane, <a href="http://dx.doi.org/10.1007/978-1-4757-2016-7">Sphere Packings, Lattices and Groups</a>, Springer-Verlag, p. 151.
%H A006088 Robert L. Griess Jr., <a href="http://arXiv.org/abs/math/0403480">Pieces of 2^d: Existence and uniqueness for Barnes-Wall and Ypsilanti lattices</a>, arXiv:math/0403480 [math.GR], Mar 28 2004. See Proposition 8.9.
%H A006088 J. Leech, <a href="http://dx.doi.org/10.4153/CJM-1964-065-1">Some sphere packings in higher space</a>, Canad. J. Math., 16 (1964), 657-682.
%H A006088 J. Leech & N. J. A. Sloane, <a href="/A006088/a006088.pdf">Correspondence, 1975</a>
%H A006088 C. Musès, <a href="http://dx.doi.org/10.1016/S0096-3003(97)00004-0">The dimensional family approach in (hyper)sphere packing...</a>, Applied Math. Computation 88 (1997), pp. 1-26, see p. 22.
%H A006088 G. Nebe and N. J. A. Sloane, <a href="http://www.math.rwth-aachen.de/~Gabriele.Nebe/LATTICES/kiss.html">Table of highest kissing numbers known</a>
%H A006088 <a href="/index/Ba#BW">Index entries for sequences related to Barnes-Wall lattices</a>
%F A006088 a(n) = (2+2)(2+4)(2+8)(2+16)...(2+2^n).
%F A006088 From _Paul D. Hanna_, Sep 16 2009: (Start)
%F A006088 G.f.: Sum_{n>=0} 2^(n*(n+1)/2) * x^n/[Product_{k=1..n+1} (1-2^k*x)];
%F A006088 contrast with:
%F A006088 1 = Sum_{n>=0} 2^(n*(n+1)/2) * x^n/[Product_{k=1..n+1} (1+2^k*x)]. (End)
%F A006088 a(n) ~ c * 2^(n*(n+1)/2), where c = A081845. - _Vaclav Kotesovec_, Dec 31 2015
%p A006088 a[0]:=1: for n from 1 to 16 do a[n]:=(2^n+2)*a[n-1] od: seq(a[n],n=0..16); # _Emeric Deutsch_, Dec 10 2004
%t A006088 RecurrenceTable[{a[0]==1, a[n]==(2^n + 2) a[n-1]}, a[n], {n, 0, 25}] (* _Vincenzo Librandi_, Dec 31 2015 *)
%o A006088 (PARI) {a(n)=polcoeff(sum(m=0,n,2^(m*(m+1)/2)*x^m/prod(k=1,m+1,1-2^k*x+x*O(x^n))),n)} \\ _Paul D. Hanna_, Sep 16 2009
%o A006088 (PARI) a(n) = prod(k=1, n, 2+2^k); \\ _Michel Marcus_, Jan 01 2016
%o A006088 (Magma) I:=[4]; [1] cat [n le 1 select I[n] else (2^n + 2)*Self(n-1): n in [1..20]]; // _Vincenzo Librandi_, Dec 31 2015
%Y A006088 Cf. A028362. - _Paul D. Hanna_, Sep 16 2009
%Y A006088 Cf. A081845.
%K A006088 nonn,easy
%O A006088 0,2
%A A006088 _N. J. A. Sloane_, John Leech
%E A006088 More terms from _Emeric Deutsch_, Dec 10 2004
%E A006088 Replaced arXiv URL with non-cached version - _R. J. Mathar_, Oct 23 2009