2796203

Properties

Appears in sequences

• Wagstaff primes: primes of form (2^p + 1)/3.at n=7A000979
• Jacobsthal sequence (or Jacobsthal numbers): a(n) = a(n-1) + 2*a(n-2), with a(0) = 0, a(1) = 1; also a(n) = nearest integer to 2^n/3.at n=23A001045
• Table T(n,k) in which n-th row lists prime factors of 2^n + 1 (n >= 0), with repetition.at n=52A001269
• Smallest primitive factor of 2^(2n+1) + 1.at n=11A002185
• Largest prime factor of 2^n + 1.at n=23A002587
• Largest primitive factor of 2^(2n+1) + 1.at n=11A002589
• Divisors of 2^46 - 1.at n=6A003551
• a(2*n) = 2*a(2*n-1), a(2*n+1) = 2*a(2*n)-1.at n=23A005578
• a(n) = (2^(2*n + 1) + 1)/3.at n=11A007583
• 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=34A007802
• Number of Barlow packings with group P3(bar)m1(SO) that repeat after 2n-1 layers.at n=23A011950
• Cyclotomic polynomials at x=-2.at n=23A020501
• a(n) = C(n,0) + C(n,3) + ... + C(n,3[n/3]).at n=23A024493
• a(n) = C(n,2) + C(n,5) + ... + C(n, 3*floor(n/3)+2).at n=23A024495
• Primes in the Jacobsthal sequence (A001045).at n=8A049883
• Table T(n,k) in which n-th row lists prime factors of 2^n + 1 (n >= 0), without repetition.at n=46A060444
• Quotient of A000225 and A064084.at n=45A064085
• Condensed version of A064085: all terms of A064085 with values greater than 1 (which coincides with all terms of A064085 with nonprime power index).at n=23A064086
• Smallest prime having alternating bit sum (A065359) equal to -n, or 0 if no such prime exists.at n=10A065085
• a(n) = (lcm_{k=0..n} (2^k + 1))/(lcm_{k=0..n-1} (2^k + 1)).at n=22A066845