Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006088
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006088 a(n) = (2^n + 2) a(n-1) (kissing number of Barnes-Wall lattice in dimension 2^n).
(Formerly M3606)
+0
2
1, 4, 24, 240, 4320, 146880, 9694080, 1260230400, 325139443200, 167121673804800, 171466837323724800, 351507016513635840000, 1440475753672879672320000, 11803258325595576034990080000, 193408190923209108909347450880000 (list; graph; listen)
OFFSET

0,2

REFERENCES

J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag, p. 151.

J. Leech, Some sphere packings in higher space, Canad. J. Math., 16 (1964), 657-682.

C. Muses, The dimensional family approach in (hyper)sphere packing..., Applied Math. Computation 88 (1997), pp. 1-26, see p. 22.

LINKS

Robert L. Griess Jr. Pieces of 2^d: Existence and uniqueness for Barnes-Wall and Ypsilanti lattices. Mar 28 2004. See Proposition 8.9.

G. Nebe and N. J. A. Sloane, Table of highest kissing numbers known

Index entries for sequences related to Barnes-Wall lattices

FORMULA

(2+2)(2+4)(2+8)(2+16)...(2+2^n ).

MAPLE

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); (Deutsch)

CROSSREFS

Sequence in context: A052718 A061640 A126391 this_sequence A141013 A095340 A141014

Adjacent sequences: A006085 A006086 A006087 this_sequence A006089 A006090 A006091

KEYWORD

nonn,easy

AUTHOR

njas, John Leech

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 10 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 3 16:57 EST 2008. Contains 151279 sequences.


AT&T Labs Research