A010087 -id:A010087 - cp's OEIS frontend

A340030 Triangle read by rows: T(n,k) is the number of hypergraphs on n labeled vertices with k edges and all vertices having even degree, 0 <= k < 2^n.

1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 7, 7, 0, 0, 1, 1, 0, 0, 35, 105, 168, 280, 435, 435, 280, 168, 105, 35, 0, 0, 1, 1, 0, 0, 155, 1085, 5208, 22568, 82615, 247845, 628680, 1383096, 2648919, 4414865, 6440560, 8280720, 9398115, 9398115, 8280720, 6440560, 4414865, 2648919, 1383096, 628680, 247845, 82615, 22568, 5208, 1085, 155, 0, 0, 1

Offset: 0

Andrew Howroyd, Jan 09 2021

Hypergraphs are graphs in which an edge is connected to a nonempty subset of vertices rather than exactly two of them. An edge is a nonempty subset of vertices.
Equivalently, T(n,k) is the number of subsets of {1..2^n-1} with k elements such that the bitwise-xor of the elements is zero.
Also the coefficients of polynomials p_{n}(x) which have the representation
  p_{n}(x) = (x + 1)^(2*(n - 1) - 1)*q_{n - 1}(x), where q_{n}(x) are the polynomials defined in A340263, and n >= 2. - Peter Luschny, Jan 10 2021

			Triangle begins:
[0]  1;
[1]  1, 0;
[2]  1, 0, 0,  1;
[3]  1, 0, 0,  7,   7,   0,   0,   1;
[4]  1, 0, 0, 35, 105, 168, 280, 435, 435, 280, 168, 105, 35, 0, 0, 1;

Andrew Howroyd, Table of n, a(n) for n = 0..2046 (rows 0..10)
Wikipedia, Hypergraph.

Rows 3..8 are A002394, A010085, A010086, A010087, A010088, A010089.
Row sums are A016031(n+1).
Column k=3 gives A006095.
Cf. A058878, A281123, A340312, A340263.

T(n,k) = {(binomial(2^n-1, k) + (-1)^((k+1)\2)*(2^n-1)*binomial(2^(n-1)-1, k\2))/2^n}
{ for(n=0, 5, print(vector(2^n, k, T(n,k-1)))) }

T(n,k) = (binomial(2^n-1, k) + (-1)^ceiling(k/2)*(2^n-1)*binomial(2^(n-1)-1, floor(k/2)))/2^n.
T(n,2*k) + T(n,2*k+1) = binomial(2^n-1, k)/2^n = A281123(n,k).
T(n, k) = T(n, 2^n-1-k) for n >= 2.

A010092 Weight distribution of d=4 Hamming code of length 63.

Original entry on oeis.org

1, 0, 9765, 1057224, 60544953, 1996794072, 41694856749, 584173436400, 5724932809365, 40448633569680, 210758816714985, 823875120414360, 2447745309517725, 5580858785942664, 9832942289229633, 13449656041565856

Offset: 0

N. J. A. Sloane

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

Georg Fischer, Table of n, a(n) for n = 0..30
List of weight distributions

Cf. A010087.

m:=63; RecurrenceTable[{a[n]==(Binomial[m, n-1]-a[n-1]-(m-n+2)*a[n-2])/n, a
[0]==1, a[1]==0}, a, {n, 0, m}][[1;;m-2;;2]] (* Georg Fischer, Jul 14 2020; from the reference, p. 129 *)

a(n) = A010087(2n). - Georg Fischer, Jul 14 2020

cp's OEIS Frontend

A340030 Triangle read by rows: T(n,k) is the number of hypergraphs on n labeled vertices with k edges and all vertices having even degree, 0 <= k < 2^n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula