120808

Appears in sequences

• 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, 0), (-1, 1, 0), (0, 0, 1), (0, 1, -1), (1, -1, 0)}.at n=12A148103
• a(n) = number of partitions of d(n) into d(k)'s, where the k's are each <= n and distinct, but the d(k)'s need not be distinct. Here d(m) = the number of divisors of m.at n=59A175108
• Number of (n+1)X(1+1) 0..3 arrays with the maximum minus the minimum of every 2X2 subblock equal.at n=3A237333
• Number of (n+1)X(4+1) 0..3 arrays with the maximum minus the minimum of every 2X2 subblock equal.at n=0A237336
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum minus the minimum of every 2X2 subblock equal.at n=6A237340
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum minus the minimum of every 2X2 subblock equal.at n=9A237340