63536
domain: N
Appears in sequences
- Largest palindromic substring in 8^n.at n=43A046266
- Palindromes with exactly 7 prime factors (counted with multiplicity).at n=6A046333
- a(1) = 1; a palindrome is included in the sequence if it has a prime signature that is different from all previous terms.at n=38A083433
- Palindromes with distinct prime signatures that occur naturally. Smallest palindrome with a prime signature of A025487(n), or 0 if no such number exists.at n=33A083435
- Smallest palindromic number with exactly n divisors, or 0 if no such number exists.at n=29A083753
- Least k such that k and digit reversal of k both have n divisors, or 0 if no such number exists.at n=29A090315
- Palindromes n such that n+(product of digits of n) gives a larger palindrome.at n=20A114341
- Number of intersections of at least four edges in a cube of n X n X n smaller cubes.at n=38A126562
- Number of ways to place 2 nonattacking knights on an n X n toroidal board.at n=18A172529
- Number of ways to place 2 nonattacking kings on an n X n toroidal board.at n=18A179403
- Number of 2-compositions of n having no increasing columns.at n=13A181306
- Zeroless numbers n such that n and n - (product of digits of n) are both palindromes.at n=41A229761
- Number of (n+1)X(2+1) 0..2 arrays x(i,j) with row sums sum{j^2*x(i,j), j=1..2+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..n+1} nondecreasing.at n=3A232781
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays x(i,j) with row sums sum{j^2*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..n+1} nondecreasing.at n=11A232783
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays x(i,j) with row sums sum{j^2*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..n+1} nondecreasing.at n=13A232783
- Numbers k with nonzero digits such that k +/- the product of digits of k are both palindromes.at n=22A244547
- Palindromes n with nonzero digits such that n +/- the product of digits of n are both palindromes.at n=16A244548