36711
domain: N
Appears in sequences
- Number of partitions of n with at least one odd part.at n=40A086543
- Number of permutations of 1..n with sum (i-p(i))^2 <= n*(n-1)/2.at n=9A179263
- Number of permutations of 1..n with sum (i-p(i))^2 < n*(n-1)/2.at n=9A179265
- Number of partitions of 2n that contain odd parts.at n=20A182616
- Number of partitions p of n such that floor(n/2) is not a part of p.at n=39A238546
- Number of partitions of n such that neither floor(n/2) nor ceiling(n/2) is a part.at n=39A238623
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 65", based on the 5-celled von Neumann neighborhood.at n=37A270085
- Triangle read by rows: T(n,k) is the number of inequivalent colorings of lone-child-avoiding rooted trees with n colored leaves using exactly k colors.at n=32A339645
- Number of integer partitions of n with alternating product > 1.at n=40A347448
- a(n) = 6*binomial(n,4) + 6*binomial(n,3) + 4*binomial(n,2) + 2*n + 1.at n=20A385689