1082401

Appears in sequences

• sigma_5(n), the sum of the 5th powers of the divisors of n.at n=15A001160
• Divisors of 2^25 - 1.at n=6A003533
• Numbers n such that game of n X n Button Madness need have no solution; this lists only the primitive elements of the set.at n=29A007802
• Numerator of sum of -5th powers of divisors of n.at n=15A017673
• Cyclotomic polynomials at x=2.at n=25A019320
• a(n) = 1^n + 2^n + 4^n + 8^n + 16^n.at n=5A020514
• a(n) = (2^5^(n+1) - 1)/(2^5^n - 1).at n=1A051155
• a(n) = (2^p^2 - 1)/(2^p - 1) where p is the n-th prime.at n=2A051156
• a(n) = n^4 + n^3 + n^2 + n + 1.at n=32A053699
• a(n) = (2^n - 1)/product(2^p - 1) where the product is over all distinct primes p that divide n.at n=24A055515
• Positions of nonzero coefficients in cyclotomic polynomial Phi_n(x), converted from binary to decimal.at n=25A063670
• Positions of positive coefficients in cyclotomic polynomial Phi_n(x), converted from binary to decimal.at n=25A063696
• Zsigmondy numbers for a = 2, b = 1: Zs(n, 2, 1) is the greatest divisor of 2^n - 1 (A000225) that is coprime to 2^m - 1 for all positive integers m < n.at n=24A064078
• Reduced binary string self-substitutions: a(n) is obtained by substituting n for each 1-bit in the binary expansion of n, then dividing by n.at n=30A065160
• Value of n-th cyclotomic polynomial at 2^n.at n=4A070526
• Smallest base-2 Fermat pseudoprime x that has ord(2,x) = n, or 0 if one does not exist.at n=24A086250
• a(n) = direuler(p=2,n,1/(1-X)/(1-p*n*X))[n].at n=15A089745
• Number of cases in which the first player is killed in a Russian roulette game where 5 players use a gun with n chambers and the number of bullets can be from 1 to n. Players do not rotate the cylinder after the game starts.at n=20A119610
• a(n) = (2^(n^2) - 1)/(2^n - 1).at n=4A128889
• a(n) is the maximal overpseudoprime q to base 2 such that the multiplicative order of 2 mod q equals A143584(n).at n=2A131952