0,2

Also number of distinct binary linear codes of length n and any dimension.

Equivalently, number of subgroups of the abelian group (C_2)^n.

J. Goldman and G.-C. Rota, The number of subspaces of a vector space, pp. 75-83 of W. T. Tutte, editor, Recent Progress in Combinatorics. Academic Press, NY, 1969.

I. P. Goulden and D. M. Jackson, Combinatorial Enumeration. Wiley, NY, 1983, p, 99.

F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier-North Holland, 1978, p. 698.

Kent E. Morrison, Integer Sequences and Matrices Over Finite Fields, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.1.

D. Slepian, A class of binary signaling alphabets. Bell System Tech. J. 35 (1956), 203-234.

D. Slepian, Some further theory of group codes. Bell System Tech. J. 39 1960 1219-1252.

M. Sved, Gaussians and binomials, Ars. Combinatoria, 17A (1984), 325-351.

Index entries for sequences related to binary linear codes

O.g.f.: A(x) = Sum_{n>=0} x^n / Product_{k=0..n} (1 - 2^k*x). - Paul D. Hanna (pauldhanna(AT)juno.com), Dec 06 2007

O.g.f.: A(x) = 1/(1-x) + x/((1-x)*(1-2x)) + x^2/((1-x)*(1-2x)*(1-4x)) + x^3/((1-x)*(1-2x)*(1-4x)*(1-8x)) + ...

Also generated by iterated binomial transforms in the following way:

[1,2,5,16,67,374,2825,29212,...] = BINOMIAL([1,1,2,6,26,158,1330,..]);

[1,2,6,26,158,1330,15414,245578,...] = BINOMIAL([1,1,3,13,83,749,...]);

[1,3,13,83,749,9363,160877,...] = BINOMIAL^2([1,1,5,33,317,4361,...]);

[1,5,33,317,4361,82789,2148561,...] = BINOMIAL^4([1,1,9,97,1433,...]);

[1,9,97,1433,30545,902601,...] = BINOMIAL^8([1,1,17,321,7601,252833,...]);

etc.

(PARI) a(n)=polcoeff(sum(k=0, n, x^k/prod(j=0, k, 1-2^j*x+x*O(x^n))), n) - Paul D. Hanna (pauldhanna(AT)juno.com), Dec 06 2007

Cf. A006516. Row sums of A022166.

Sequence in context: A019503 A019504 A005163 this_sequence A122082 A002631 A107948

Adjacent sequences: A006113 A006114 A006115 this_sequence A006117 A006118 A006119

nonn,easy,nice

njas