|
| |
|
|
A053601
|
|
Number of bases of an n-dimensional vector space over GF(2).
|
|
4
| |
|
|
1, 1, 3, 28, 840, 83328, 27998208, 32509919232, 132640470466560, 1927943976061501440, 100981078400558897823744, 19242660536873338307044442112, 13448310596010038676027219703234560
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
REFERENCES
| Claude Carlet, Philippe Gaborit, Jon-Lark Kim and Patrick Sole, A new class of codes for Boolean masking of cryptographic computations, Arxiv preprint arXiv:1110.1193, 2011
R. Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications, Cambridge 1986
|
|
|
FORMULA
| a(n) = (2^n-1)(2^n-2)...(2^n-2^(n-1))/n!.
|
|
|
EXAMPLE
| a(2)=3 because the 3 bases are {01,10}, {01,11}, {10,11}.
|
|
|
CROSSREFS
| Cf. A002884.
Sequence in context: A084880 A110259 A015474 * A140990 A196735 A122891
Adjacent sequences: A053598 A053599 A053600 * A053602 A053603 A053604
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Fred Galvin (galvin(AT)math.ukans.edu), Jan 20 2000
|
|
|
EXTENSIONS
| More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 05 2000
|
| |
|
|
