21842

Appears in sequences

• Numbers whose base-2 representation has exactly 14 runs.at n=6A043581
• Row sums of array T as in A054110.at n=13A054111
• Main diagonal of table A083050.at n=17A083052
• Triangle read by rows: T(n,k) is the number of permutations p of [n] for which k is the smallest among the positive differences p(i+1) - p(i); k=0 for the reversal of the identity permutation (0<=k<=n-1).at n=51A180190
• Number of 0..n arrays of length 3 with 0 never adjacent to n.at n=26A212836
• Number of partitions p of n such that the number of numbers having multiplicity 1 in p is a part or the number of numbers having multiplicity > 1 is a part.at n=38A239737
• Least number m such that there exist exactly n pairs of numbers (a,b), 0 < a < b < m, such that a+b, a+m, and b+m are all squares.at n=27A246766
• Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 2 3 6 or 7.at n=8A252294
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 2 3 6 or 7.at n=36A252295
• Number of distinct board states reachable in n jumps, in English Peg Solitaire.at n=7A335656
• Numbers k such that the total number of consecutive runs of zeros of length m in every binary expansion from 1 to k, is even, for all m != floor(log_2(k)).at n=38A360320