20116
domain: N
Appears in sequences
- Fibonacci iteration starting with (1, a(n)) leads to a "nine digits anagram".at n=31A034587
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 4 (mod 5).at n=48A035565
- Number of conjugacy classes of elements of order n in 2.E_7(C).at n=26A045515
- Engel expansion of e^gamma (gamma is the Euler-Mascheroni constant A001620) = 1.78107.at n=13A059199
- Unicode codes for the Han digits.at n=5A061745
- Number of -4..4 arrays x(0..n-1) of n elements with zero sum and no two neighbors equal.at n=5A199700
- T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zero sum and no two neighbors equal.at n=41A199704
- Number of -n..n arrays x(0..5) of 6 elements with zero sum and no two neighbors equal.at n=3A199708
- Numbers that are the sum of eight fourth powers in nine or more ways.at n=15A345584
- Numbers that are the sum of eight fourth powers in ten or more ways.at n=5A345585
- Numbers that are the sum of eight fourth powers in exactly ten ways.at n=5A345842