35383
domain: N
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, 0, 1), (-1, 1, 0), (0, -1, 1), (1, 1, -1), (1, 1, 1)}.at n=8A149792
- Zeroless numbers n whose digit product squared is equal to the digit product of n^2.at n=20A256115
- Number of n X 1 0..3 arrays with every repeated value in every row and column greater than the previous repeated value.at n=7A267928
- T(n,k)=Number of nXk 0..3 arrays with every repeated value in every row and column greater than the previous repeated value.at n=28A267933
- T(n,k)=Number of length-n 0..k arrays with no repeated value greater than or equal to the previous repeated value.at n=52A269409
- Odd numbers n such that q(n)^2 = q(n^2) != 0, where q(n) is the digit product on base 10.at n=11A278316