36650

Appears in sequences

• Number of distinct sums of reciprocals of parts of partitions of n.at n=45A212187
• Number of hybrid 10-ary trees with n internal nodes.at n=4A245053
• Numbers n such that sigma(Rev(phi(n))) = phi(Rev(sigma(n))), where sigma is the sum of divisors and phi the Euler totient function.at n=10A252255
• Number of length 3 1..(n+2) arrays with no leading partial sum equal to a prime.at n=42A254541
• Numbers of the form p^2 + q^2 = r^3 + s^3 with p, q, r, s primes.at n=2A283359
• a(1) = 1; a(n+1) = Sum_{d|n} sigma(n/d)*a(d), where sigma = sum of divisors (A000203).at n=40A307817
• Number of permutations of [n] that avoid the shuffle pattern s-k-t, where s = 12 and t = 123.at n=8A324135
• Number of integer partitions of n > 0 that are not the first sums of any composition with all parts > 1.at n=39A391620