63260

Appears in sequences

• -1 + number of partitions of n.at n=43A000065
• Number of partitions of n into relatively prime parts. Also aperiodic partitions.at n=43A000837
• Number of partitions of n into parts all relatively prime to n.at n=42A057562
• Let A denote the sequence; then A is equal to the union of the self-convolutions A^2 and A^4, with terms in ascending order by size, where a(0)=1.at n=31A090847
• a(n) = A056188(n)/n.at n=21A098792
• Number of partitions of n such that multiplicities of parts are all relatively prime to n.at n=42A100495
• Number of partitions of n in which the number of parts is relatively prime to n.at n=42A102628
• a(n) = A000041(n) - A032741(n).at n=43A167934
• Number of -3..3 arrays x(0..n-1) of n elements with zeroth through n-1st differences all nonzero.at n=6A199938
• T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zeroth through n-1st differences all nonzero.at n=42A199943
• Number of -n..n arrays x(0..6) of 7 elements with zeroth through 6th differences all nonzero.at n=2A199948
• Number of partitions of n into parts <= phi(n), where phi is Euler's totient function (cf. A000010).at n=43A227296
• Number of (n+1) X (1+1) 0..1 arrays colored with the sum of the upper and lower median values of each 2 X 2 subblock.at n=12A236323
• Number of partitions of n such that no part is a prime divisor of n.at n=43A237125
• 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=42A292726
• Number of integer partitions of n that cannot be partitioned into two or more blocks with equal sums.at n=43A321451
• Number of integer partitions of n with 2 distinct parts or at least 3 parts.at n=43A325269
• Number of integer partitions of 2n such that 2*(minimum) = (mean).at n=43A363132
• Number of integer partitions of n whose product of parts is not n.at n=43A379736
• Number of integer partitions of n not forming an arithmetic progression with offset 0.at n=43A389920