21636

Appears in sequences

• -1 + number of partitions of n.at n=37A000065
• Number of partitions of n into relatively prime parts. Also aperiodic partitions.at n=37A000837
• a(n) = floor( Sum_{1 <= i < j <= n} ((sqrt(j)-sqrt(i))^3) ).at n=47A025197
• Number of partitions of n into parts all relatively prime to n.at n=36A057562
• Number of partitions of n such that multiplicities of parts are all relatively prime to n.at n=36A100495
• Number of partitions of n in which the number of parts is relatively prime to n.at n=36A102628
• First differences of A115855.at n=35A115856
• Numbers which converge to 2592 under repeated application of the powertrain map of A133500.at n=18A135384
• Expansion of e.g.f.: (1+x)/(1-x*exp(x)).at n=6A138909
• a(n) = A000041(n) - A032741(n).at n=37A167934
• Number of partitions of n into square parts.at n=36A179662
• Number of arrangements of 4 nonzero numbers x(i) in -n..n with the sum of x(i)*x(i+1) equal to zero.at n=30A188250
• The number of multinomial coefficients, based on a set of partitions of n into m positions, divisible by m entirely.at n=36A200144
• Number of partitions of n into parts <= phi(n), where phi is Euler's totient function (cf. A000010).at n=37A227296
• Number of partitions of n such that no part is a prime divisor of n.at n=37A237125
• Concatenation of n^3 and n^2.at n=5A239461
• Indices of primes in A007443.at n=30A287915
• a(n) is the number of states that can be achieved when starting from n piles each containing one stone, where any number of stones can be transferred between piles that start with the same number of stones.at n=36A292726
• Numbers k such that (19*10^k - 43)/3 is prime.at n=17A294377
• Self-convolution of the Dedekind psi function (A001615).at n=38A307502