26873

Appears in sequences

• Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=3, r=3, I={-1,0,2}.at n=21A079987
• Odd composites (including 1 in the count) where the number 1 mod 4 equals the number 3 mod 4.at n=6A093180
• Number of partitions of n into parts having at most two prime-factors.at n=40A101049
• 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, 0, 1), (1, -1, 1), (1, 0, 1), (1, 1, -1)}.at n=9A148909
• G.f. satisfies: A(x) = exp( Sum_{n>=1} x^n/n * Product_{k>=1} 1/(1 - x^(n*k)*A(x^n)^k) ).at n=10A219231
• Number of 3 X n 0..1 arrays with rows nondecreasing and antidiagonals unimodal.at n=32A224134
• G.f.: Product_{k>=1} (1 + x^(k^3)) / (1 - x^k).at n=34A280278
• Number of subsets of {1..n} containing n such that every subset has a different sum.at n=34A325866
• The reversing binary representation of the sum of the divisors of the n-th odd square: a(n) = A065621(A379223(n)).at n=37A379224