1016801

Appears in sequences

• 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=28A007802
• Cyclotomic polynomials at x=-2.at n=25A020501
• 10th cyclotomic polynomial evaluated at powers of 2.at n=5A020518
• a(n) = n^4 - n^3 + n^2 - n + 1.at n=32A060884
• a(n) = (2^(prime(n)^2) + 1)/(2^prime(n) + 1).at n=1A065869
• a(n) = (lcm_{k=0..n} (2^k + 1))/(lcm_{k=0..n-1} (2^k + 1)).at n=24A066845
• a(n) = (2^((2*n-1)^2)+1)/(2^(2*n-1)+1).at n=2A069255
• Triangular array read by rows: row s contains integers of the form (2^s+1)/(2^r+1) in order of increasing r <= s-1.at n=26A079665
• Sylvester-Jacobsthal cyclotomic numbers.at n=24A105603
• a(n) is the maximal overpseudoprime q to base 2 such that the multiplicative order of 2 mod q equals A143584(n).at n=15A131952
• Overpseudoprimes to base 2: composite k such that k = A137576((k-1)/2).at n=24A141232
• Numbers representable as Phi(k,2), the k-th cyclotomic polynomial evaluated at 2, for some k>0.at n=37A153601
• Numbers k (between 2^(m-1) and 2^m) such that 2^(k-1) == 1 (mod k) and 2^(k-1-m) == k - 2^p (mod k) for some p > 0 with 2^p < k.at n=26A167612
• Fermat pseudoprimes that are not Carmichael numbers and have only composite XOR couples as defined in A182108.at n=10A252944
• a(n) = 1 - sigma(n) + sigma(n)^2 - sigma(n)^3 + sigma(n)^4.at n=20A259410
• a(n) = 1 - sigma(n) + sigma(n)^2 - sigma(n)^3 + sigma(n)^4.at n=30A259410
• Numbers k > 1 such that 2^k == 2 (mod k) and gcd(k, 3^k - 3) = 1.at n=18A300762
• Numbers k such that 2^(k-1) == 1 (mod k) and lpf(k)-1 does not divide k-1.at n=28A316906
• Numbers k such that 2^(k-1) == 1 (mod k) and p-1 does not divide k-1 for every prime p dividing k.at n=25A316907
• Array T(n,m) = (2^(m*(2*n+1))+1)/(2^m+1) read by antidiagonals.at n=16A360967