35964
domain: N
Appears in sequences
- Expansion of 1 / Product_{k >= 1} (1-q^k)^2*(1-q^(11k))^2.at n=21A032442
- Triangle with n >= k >= 0 where a(n,k) = 2^k*3^(n-k)*(C(n+1,0)+C(n+1,1)+...C(n+1,k)).at n=30A061929
- Numbers which are the sum of two positive cubes and divisible by 37.at n=37A102618
- a(n) = n^3 plus sum of digits of n^3.at n=32A123135
- a(n) is the smallest number such that a(n)*n is an anagram of a(n)*3.at n=21A175692
- q-expansion of modular form psi_0^4/t_{3B}.at n=33A198956
- Number of n X 2 0..2 arrays with rows and columns lexicographically nondecreasing and every element equal to at least one horizontal or vertical neighbor.at n=12A201533
- Numbers n equal to the sum of all numbers created from permutations of d digits sampled from n, for some d with 1 <= d < length(n).at n=3A241754
- Numbers of the form A000217(n)*A007494(n) that are divisible by 3.at n=30A295867
- Osiris or Digit re-assembly numbers: numbers that are equal to the sum of permutations of subsamples of their own digits.at n=5A319274