22184

Appears in sequences

• Number of labeled rooted trees of nonempty sets with n points. (Each node is a set of 1 or more points.)at n=5A048802
• Numbers k such that sopf(k) = 2*sopf(k+1), where sopf(k) = A008472.at n=25A064112
• Number of partitions of n having positive odd rank (the rank of a partition is the largest part minus the number of parts).at n=45A101707
• Positive integers k such that 13^k == 9 (mod k).at n=17A116636
• Numbers k such that if x = sigma(k) + tau(k) - k then k = sigma(x) + tau(x) - x.at n=21A238226
• Number of partitions p of n such that (number of numbers of the form 5k + 1 in p) is a part of p.at n=39A241550
• Numbers k where k^2 is an anagram of (k+2)^2.at n=11A261749
• Number of ways to split a strict integer partition of n into consecutive subsequences with strictly decreasing sums.at n=44A318684
• Greater members of dihedral amicable pairs: numbers (m, k) such that t(m) = t(k) = m + k, where t(k) = sigma(k) + d(k).at n=5A322254
• Triangle read by rows: T(n,k) is the number of labeled quasi-loop-threshold graphs on vertex set [n] with k components, for n >= 1 and 1 <= k <= n.at n=15A350746