33635
domain: N
Appears in sequences
- Numbers k such that k and k^2 use only the digits 1, 2, 3, 5 and 6.at n=54A136974
- Triangular array T(n,k) n,k>=0 is the number of k letter words formed using at most 1a,2b's,3c's,...,n#'s.at n=32A172528
- Number of nX3 binary arrays with top left value 1 and no two ones adjacent horizontally, vertically or antidiagonally.at n=9A228477
- Number of (n+2)X(3+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 1 2 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 1 2 4 6 or 7.at n=4A252553
- T(n,k) = Number of (n+2) X (k+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 1 2 4 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 1 2 4 6 or 7.at n=25A252558
- Number of (5+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 1 2 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 1 2 4 6 or 7.at n=2A252563
- Least odd k such that C(2k, k) == 1 (mod A007775(n)), or 0 if no such k exists.at n=24A373469