26598

Appears in sequences

• Number of series-reduced planted trees with n+9 nodes and 4 internal nodes.at n=38A001860
• Alkane (or paraffin) numbers l(8,n).at n=20A005995
• Let pi be an unrestricted partition of n with the summands written as binary numbers; a(n) is the number of such partitions with an even number of binary ones.at n=42A102425
• Define an array by d(m, 0) = 1, d(m, 1) = m; d(m, k) = (m - k + 1) d(m+1, k-1) - (k-1) (m+1) d(m+2, k-2). Sequence gives d(n,3).at n=31A126935
• 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), (0, 1, 0), (1, 0, 1)}.at n=8A150260
• Numbers k such that k![7]-1 is prime (where k![7] = A114799(k) = septuple factorial).at n=58A156167
• a(n) = 2662*n - 22.at n=9A157609
• Number of (n+2) X 4 binary arrays with each 3 X 3 subblock having rows and columns in lexicographically nondecreasing order.at n=21A184541
• The nearest integer of perimeter of T-square (fractal) after n-iterations, starting with a unit square.at n=20A227621
• Numbers n having at least two distinct symmetrical pairs of divisors (a, b) and (b', a') such that n = a*b = b'*a' with a' = reverse(a) and b' = reverse(b).at n=39A228164
• a(n) = cpg(n, 3) + cpg(n, 4) + ... + cpg(n, n) where cpg(n, m) is the m-th n-th-order centered polygonal number.at n=20A257051
• a(0)=1; a(n) = Sum_{k=1..n-1} d(k)*a(n-k), where d(m) is m-th bit in binary expansion of n.at n=25A260956
• Convolution of nonzero hexagonal numbers (A000384) with themselves.at n=10A271870
• Number of n-element subsets of [n+5] having an even sum.at n=20A282081
• Expansion of (1 + 4*x)/sqrt(1 - 4*x).at n=8A349835
• Expansion of 1/sqrt(1 - 4*x/(1 - x^2)^2).at n=8A376810