32155

Appears in sequences

• a(n) = T(n,n), T given by A026568. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=0.at n=13A026569
• 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), (1, -1, 0), (1, 0, 0), (1, 0, 1)}.at n=9A149902
• Number of nX2 0..2 arrays with no more than floor(nX2/2) elements equal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=6A223144
• T(n,k)=Number of nXk 0..2 arrays with no more than floor(nXk/2) elements equal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=29A223149
• T(n,k)=Number of nXk 0..2 arrays with no more than floor(nXk/2) elements equal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=34A223149
• Total number of corners in all partitions of n. A corner of a partition is a point of degree two in the corresponding Ferrers diagram.at n=28A265258
• Number of ways to write n as an ordered sum of 10 primes.at n=14A340966
• The indices k where A377015(k) = 1.at n=4A377928