120001

Appears in sequences

• Coefficients of monic primitive irreducible polynomials over GF(3) listed in lexicographic order.at n=31A058949
• Smallest multiple of n with digit sum = 4, or 0 if no such number exists, e.g. a(3k)= 0.at n=48A069523
• Smallest nontrivial multiple of n whose digit sum is the same as that of the digit sum of n. By nontrivial one means a(n) is not equal to n or (10^k)*n. 0 if no such number exists.at n=29A087303
• Numbers k such that sigma(k) + phi(k) + d(k) = sigma(k+1) + phi(k+1) + d(k+1), where sigma(k) is the sum of the divisors of k, phi(k) the Euler totient function of k and d(k) the number of divisors of k.at n=8A259495
• Numbers n such that sum of decimal digits of n equals number of prime divisors of n counted with multiplicity and sum of distinct decimal digits of n equals number of distinct primes dividing n.at n=19A280911
• Expansion of Sum_{k>0} x^(2*k)/(1-x^k)^5.at n=39A363605
• Let q be the n-th prime power (A246655), then a(n) = q^3 + q^2 - q; number of solutions to x*y = z*w in the finite field F_q.at n=22A367014
• Numbers m such that m^m == m (mod 10^(len(m) + 2)), where len(m) is the number of digits of m (A055642).at n=29A373206