68355
domain: N
Appears in sequences
- Total number of odd parts in all partitions of n.at n=32A066897
- Partial sums of A006000.at n=26A133252
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 1, 1), (0, 0, 1), (1, -1, 1), (1, 1, -1)}.at n=10A148424
- Number of vertices in truncated tetrahedron with faces that are centered polygons.at n=22A193218
- Triangular array read by rows. T(n,k) is the number of labeled bipartite graphs on n nodes having exactly k connected components; n>=1, 1<=k<=n.at n=40A228859
- a(n) = Sum_{k=0..4} binomial(8,k)*binomial(n,k).at n=13A247609
- Irregular triangle read by rows: T(n, k) is the q-multinomial coefficient defined by the k-th partition of n in Abramowitz-Stegun order, evaluated at q = 2.at n=26A347485
- Triangle T(n,k) read by rows: the number of symmetric binary n X n matrices with k ones and no all-1 2 X 2 submatrix.at n=63A350189
- Odd numbers k such that gcd(A276086(sigma(k)-k), A276086(k)) is equal to A276086(k), where A276086 is the primorial base exp-function, and sigma is the sum of divisors function.at n=35A388267