1657009

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=30A007802
• Squarefree part of 2^n+1 : the smallest number such that a(n)*(2^n+1) is a square.at n=27A069111
• a(n) = (2^(3^n)+1)/3^(n+1).at n=2A070632
• a(n) = (n^(n+1)+(-1)^n)/(n+1)^2.at n=8A081215
• Least number k such that the binary expansion of n*k has fewer ones than n, or 0 if no such k exists.at n=80A143073
• Number of 2-elements orbits of S3 action on irreducible polynomials of degree 3n, n > 0, over GF(2).at n=26A165920
• a(n) = (2^(3^(n-1)) + 1)/3^n, n >= 1.at n=3A234039
• Smallest positive integer solution x = a(n) of (3^4)*x - 2^n*y = 1 for n >= 0.at n=21A239130
• Smallest positive integer solution x = a(n) of (3^4)*x - 2^n*y = 1 for n >= 0.at n=22A239130
• Smallest positive integer solution x = a(n) of (3^4)*x - 2^n*y = 1 for n >= 0.at n=23A239130
• Smallest positive integer solution x = a(n) of (3^4)*x - 2^n*y = 1 for n >= 0.at n=24A239130
• Smallest positive integer solution x = a(n) of (3^4)*x - 2^n*y = 1 for n >= 0.at n=25A239130
• Smallest positive integer solution x = a(n) of (3^4)*x - 2^n*y = 1 for n >= 0.at n=26A239130
• Smallest positive integer solution x = a(n) of (3^4)*x - 2^n*y = 1 for n >= 0.at n=27A239130
• a(n) = p(0,n), where p(x,n) is the strong divisibility sequence of polynomials based on sqrt(2) as in A327320.at n=26A329005
• a(n) = (2^(A003558(n)) - A332433(n))/(2*n+1), for n >= 0.at n=40A329593
• a(n) = (2^A195610(n) + 1)/A014657(n), for n >= 1.at n=22A337220