55778

Appears in sequences

• RATS: Reverse Add Then Sort the digits applied to previous term, starting with 1.at n=11A004000
• Numbers that are not squarefree and whose Euler totient function is squarefree.at n=39A049198
• a(n) = a(n-1) + rotate( a(n-1), 1 digit right), a(1) = 1.at n=11A051300
• Numbers k such that k^10 == 1 (mod 11^4).at n=36A056094
• Numbers k such that sigma(k)*phi(k) is squarefree.at n=23A065299
• a(n) = 2*prime(n)^2.at n=38A079704
• 2*p^2, for p an odd prime.at n=37A143928
• Numbers the sum of whose even divisors is 2 times a prime.at n=17A195334
• Numbers such that the difference between the sum of the even divisors and the sum of the odd divisors is prime.at n=20A195382
• Composite numbers k such that Sum_{i=1..t-1} d(i+1)/d(i) is prime, where d(1), ..., d(t) are the divisors of k in ascending order.at n=34A255585
• a(n) is the smallest composite k such that d(2)/d(1) + d(3)/d(2) + ... + d(q)/d(q-1) = prime(n), where d(1) < d(2) < ... < d(q) are the q divisors of k, or 0 if no such k exists.at n=39A260901
• Even numbers such that the sum of the odd divisors is a prime p and the sum of the even divisors is 2p.at n=12A273459
• Where records occur in A070138.at n=39A298942
• Expansion of 2/((1 - x)*(3 - theta_3(x))), where theta_3() is the Jacobi theta function.at n=30A303667
• Number of multiset partitions of uniform integer partitions of n in which all parts have the same length.at n=48A320451
• Numbers k such that phi(k) == 2 (mod 12), where phi is the Euler totient function (A000010).at n=25A332511