20600
domain: N
Appears in sequences
- Numbers k such that sopfr(k) = sopf(k+1), where sopf(k) = A008472(k) and sopfr(k) = A001414(k).at n=18A064675
- Numbers k such that k and k^2 use only the digits 0, 2, 3, 4 and 6.at n=19A136883
- Scaled convolution of (n^3)*A000984(n) with A000984(n).at n=19A142962
- Not appropriate for the OEIS.at n=9A248690
- The difference between the two largest distinct parts of a partition (0 if no distinct parts), summed over all partitions of n.at n=28A268191
- Number of n-length words over an 8-ary alphabet {a_1,a_2,...,a_8} avoiding consecutive letters a_i, a_{i+1}.at n=5A277671
- Triangle T(m,k) read by rows, where T(m,k) is the number of ways in which 1 <= k <= m positions can be picked in an m X m square grid such that the picked positions have a line symmetry.at n=25A291718
- a(n) is the number of unlabeled connected graphs without endpoints with n edges.at n=14A342556
- Triangle read by rows: T(n,k) is the maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X k rectangle, up to rotations and reflections.at n=13A361221