124753

Properties

Appears in sequences

• -1 + number of partitions of n.at n=47A000065
• Number of partitions of n into parts all relatively prime to n.at n=46A057562
• Number of partitions of n such that multiplicities of parts are all relatively prime to n.at n=46A100495
• Number of partitions of n in which the number of parts is relatively prime to n.at n=46A102628
• Numbers k such that the k-th triangular number contains only digits {1,7,8}.at n=12A119147
• Primes p such that p-+1, p-+3, p-+5 are not squarefree.at n=26A155145
• Number of partitions of n into parts <= phi(n), where phi is Euler's totient function (cf. A000010).at n=47A227296
• Number of partitions of n such that no part is a prime divisor of n.at n=47A237125
• Numbers m such that sigma(m) is a partition number.at n=29A252891
• Primes p such that sigma(p) = 1 + p is a partition number (sorted increasingly).at n=7A252892
• 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=46A292726
• Number of integer partitions of n that cannot be partitioned into two or more blocks with equal sums.at n=47A321451
• For 1<=x<=n, 1<=y<=n, with gcd(x,y)=1, write 1 = gcd(x,y) = u*x+v*y with u,v minimal; a(n) = sum of the values of u^2+v^2.at n=42A345431
• a(1) = 1, a(2) = 2; for n > 2, a(n) = smallest positive number which has not appeared that has a common factor with a(n-2)^2 + a(n-1)^2.at n=16A358444
• Prime numbersat n=11713