31100

Appears in sequences

• Each permutation in the list A060117 converted to Site Swap notation, with digits reversed. "Zero throws" (fixed elements) indicated with 0's.at n=30A060496
• Number of ways to place 5 nonattacking queens on a 5 X n board.at n=13A061991
• Łukasiewicz words (without the last zero) for rooted plane trees where non-leaf branching can occur only at the leftmost branch of any level, but nowhere else.at n=21A209644
• Numbers n = x0 x1 x2...x9 such that xi is the number of digits greater than i in n.at n=29A226195
• Let sigma*_m (n) be result of applying sum of anti-divisors m times to n; call n (m,k)-anti-perfect if sigma*_m (n) = k*n; sequence gives the (3,k)-anti-perfect numbers.at n=19A229861
• "Inside numbers". Pick a term "t" and one of its digits "d". Now jump to the right over d digits if "d" is odd, and to the left over d digits if "d" is even. Whatever the "d" you choose, you will stay on "t".at n=33A284515
• Expansion of x * (d/dx) Sum_{k>=0} k!*x^(k*(k+1)/2)/Product_{j=1..k} (1 - x^j).at n=20A304797
• Irregular triangle read by rows: row n lists all of the distinct derivable strings in the MIU formal system that are n characters long.at n=19A369173