219912

Appears in sequences

• Palindromes with exactly 8 prime factors (counted with multiplicity).at n=5A046334
• Composite palindromes divisible by the sum of their prime factors (counted with multiplicity).at n=12A046348
• Smallest palindromic multiple of 2n-1 beginning with the digit string of 2n-1; or 0 if no such number exists.at n=10A083964
• Dimensions of certain Lie algebra (see reference for precise definition).at n=2A133353
• Triangle T(n,k), n >= 0, 0 <= k <= n, read by rows: T(n,k) is the number of forests of trees on n or fewer nodes using a subset of labels 1..n and k edges.at n=41A144258
• Number of 6-step self-avoiding walks on an n X n square summed over all starting positions.at n=29A188151
• Number of nX5 0..2 arrays with exactly floor(nX5/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=5A223031
• Number of nX6 0..2 arrays with exactly floor(nX6/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=4A223032
• T(n,k)=Number of nXk 0..2 arrays with exactly floor(nXk/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=49A223033
• T(n,k)=Number of nXk 0..2 arrays with exactly floor(nXk/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=50A223033
• Palindromes having more divisors than all smaller palindromes.at n=12A344422
• Palindromes with exactly 5 distinct prime divisors.at n=25A373465