21042

Appears in sequences

• Number of partitions of n that do not contain 6 as a part.at n=39A027340
• Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 16.at n=18A031694
• Number of partitions of n into parts not of the form 25k, 25k+10 or 25k-10. Also number of partitions with at most 9 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=37A036009
• Number of binary strings of length n with equal numbers of 000 and 011 substrings.at n=17A164139
• Sum of all parts of all partitions of n minus the number of partitions of n.at n=21A182724
• Triangular array read by rows. T(n,k) is the number of partial permutations (injective partial functions) of {1,2,...,n} that have exactly k elements in a cycle. The k elements are not necessarily in the same cycle. A fixed point is considered to be in a cycle.at n=30A206703
• Numbers k such that phi(x) = 12*k+2 is solvable, where phi is Euler's totient A000010.at n=27A289364
• Numbers n such that n^2+1 can be expressed as j^2+k^2, j>k>1, gcd(j,k)=1, in more ways than for any smaller n.at n=4A300167
• Total number of size 2 lists in all sets of lists partitioning [n] (cf. A000262).at n=7A351825