23932

Appears in sequences

• Number of switching networks (see Harrison reference for precise definition).at n=2A000833
• Coordination sequence for sigma-CrFe, Position Xf.at n=39A009958
• Numbers k such that k^4 == 1 (mod 5^5).at n=30A056102
• Smallest palindromic multiple of n-th prime.at n=43A062888
• Palindromic integers > 0, whose 'Reverse and Add!' trajectory (presumably) does not lead to another palindrome.at n=8A070001
• Palindromes with successive increasing difference: a(k)-a(k-1) > a(k+1)- a(k).at n=42A071250
• a(n) is the odd-length palindrome whose digits up to the center are those of n and whose center digit is equal to the digital root of the product of the factorial of n and the reverse of n.at n=22A082941
• Number of partitions of n having no parts with multiplicity 3.at n=40A118807
• Number of binary strings of length n with equal numbers of 0000 and 1111 substrings.at n=16A164154
• Palindromic Ulam numbers.at n=38A173542
• Numbers n such that 10^n - 41 is prime.at n=15A178406
• Numbers n such that n^2 + 1 is divisible by a 5th power.at n=15A218564
• Number of n X n 0..1 arrays with every element equal to 1, 2, 3, 5 or 8 king-move adjacent elements, with upper left element zero.at n=4A298764
• Number of nX5 0..1 arrays with every element equal to 1, 2, 3, 5 or 8 king-move adjacent elements, with upper left element zero.at n=4A298767
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 5 or 8 king-move adjacent elements, with upper left element zero.at n=40A298770
• Palindromes that can be written as the sum of two palindromic primes.at n=45A356824