59916

Appears in sequences

• T(n,n-2), array T given by A047010.at n=9A047014
• 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, 0, 0), (0, 1, 1), (1, -1, 0), (1, 1, -1), (1, 1, 0)}.at n=8A150842
• Number of n X 2 0..3 arrays with some element plus some horizontally, antidiagonally or vertically adjacent neighbor totalling three no more than once.at n=4A269137
• Number of nX5 0..3 arrays with some element plus some horizontally, antidiagonally or vertically adjacent neighbor totalling three no more than once.at n=1A269140
• T(n,k)=Number of nXk 0..3 arrays with some element plus some horizontally, antidiagonally or vertically adjacent neighbor totalling three no more than once.at n=16A269143
• T(n,k)=Number of nXk 0..3 arrays with some element plus some horizontally, antidiagonally or vertically adjacent neighbor totalling three no more than once.at n=19A269143
• Expansion of g.f. A(x) satisfying A( x*A(x)^2 + A(x)^4 ) = A(x)^3.at n=10A372526
• a(n) is the number of positive integers k for which Sum_{i=1..j} (p_i+e_i) = n, where p_1^e_1*...*p_j^e_j is the prime factorization of k.at n=48A382330