21500

Appears in sequences

• a(n) = T(5,n), array T given by A047858.at n=11A047862
• Numbers n such that (digital sum of n)^3 = reversal of n. (Powers of 10 excluded.)at n=4A085754
• 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, 1), (-1, 1, -1), (0, 0, 1), (1, 0, -1)}.at n=12A148004
• Number of (7+2) X (n+2) 0..1 arrays with every 3 X 3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=13A254913
• Number of n X 4 0..1 arrays with every element equal to 0, 1, 3, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=6A299882
• Number of nX7 0..1 arrays with every element equal to 0, 1, 3, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=3A299885
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 3, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=48A299886
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 3, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=51A299886
• a(n) = coefficient of x^n*y^n in Product_{n>=1} (1 - (x^n + y^n))^3.at n=24A322214
• a(n) is the least number k such that the continued fraction of the abundancy index of k contains n elements that are all distinct, or -1 if no such k exists.at n=6A349691