4032015

Appears in sequences

• a(n) = binomial(3*n+1,n)/(n+1).at n=10A006013
• Triangle T(n,k)of numbers of asymmetric Boolean functions of n variables with exactly k = 0..2^n nonzero values (atoms) under action of complementing group C(n,2).at n=45A022619
• Number of aperiodic necklaces of n beads of 2 colors, 11 of them black.at n=20A032169
• Number of necklaces with 11 black beads and n-11 white beads.at n=21A032196
• Duplicate of A006013.at n=10A046648
• Triangle of rooted planar maps, read by rows.at n=65A046652
• If n = 2*m then a(n) = binomial(3*m, m)/(2*m+1), if n=2*m+1 then a(n) = binomial(3*m+1, m+1)/(2*m+1).at n=21A047749
• Number of dissectable polyhedra with n tetrahedral cells and symmetry of type P.at n=41A047765
• a(n) = A047765(2n).at n=20A047767
• Triangle of numbers of inequivalent Boolean functions of n variables with exactly k nonzero values (atoms) under action of complementing group.at n=47A054724
• Expansion of reversion of (x - 2*x^2) / (1 - x)^3.at n=20A134565
• Triangle T read by rows: n-th row (n>=0) gives the non-vanishing coefficients of the polynomial q(n,x) = 2^(-n)*((x+1)^(2^n) - (x-1)^(2^n))/2.at n=21A281123
• Triangle T read by rows: n-th row (n>=0) gives the non-vanishing coefficients of the polynomial q(n,x) = 2^(-n)*((x+1)^(2^n) - (x-1)^(2^n))/2.at n=26A281123
• Number of order ideals of type e^(0)_n.at n=18A299294
• Number of primitive (1,1) pairs in the Fibonacci tree at depth 3n.at n=10A305574
• a(n) is the denominator of the sum of reciprocals of primes not exceeding n and not dividing binomial(2*n, n).at n=30A334075
• Triangle read by rows: T(n,k) is the number of subsets of {0..2^n-1} with k elements such that the bitwise-xor of all the subset members gives zero, 0 <= k <= 2^n.at n=47A340312
• Triangle read by rows: T(n,k) is the number of subsets of {0..2^n-1} with k elements such that the bitwise-xor of all the subset members gives zero, 0 <= k <= 2^n.at n=57A340312