5726623061

Appears in sequences

• a(2n) = 2*a(2n-1), a(2n+1) = 2*a(2n)+1 (also a(n) is the n-th number without consecutive equal binary digits).at n=33A000975
• 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=34A001045
• a(n) = (4^n - 1)/3.at n=17A002450
• Numerators of coefficients for central differences M_{4}^(2*n).at n=16A002675
• Numerators of the Taylor coefficients of (e^x-1)^2.at n=33A002678
• Divisors of 2^34 - 1.at n=6A003541
• Cyclotomic polynomials at x=4.at n=17A019322
• a(n) = C(n,1) + C(n,4) + ... + C(n, 3*floor(n/3) + 1).at n=33A024494
• a(n) = Sum_{k=0..floor(n/2)} A026637(n, k).at n=33A026645
• Expansion of 1/((1 - x)*(1 - 2*x)*(1 + 2*x)).at n=32A052992
• Expansion of 1/((1 - x)*(1 - 2*x)*(1 + 2*x)).at n=33A052992
• Zsigmondy numbers for a = 4, b = 1: Zs(n, 4, 1) is the greatest divisor of 4^n - 1^n (A024036) that is relatively prime to 4^m - 1^m for all positive integers m < n.at n=16A064080
• Size of "uniform" Hamming covers of distance 1, that is, Hamming covers in which all vectors of equal weight are treated the same, included or excluded from the cover together.at n=33A081374
• A Jacobsthal sequence trisection.at n=11A082311
• Jacobsthal reverse-pair sequence.at n=33A084183
• a(n) = -5*a(n-1)-4*a(n-2) with n>1, a(0)=0, a(1)=1.at n=17A084241
• Smallest base-2 Fermat pseudoprime x that has ord(2,x) = n, or 0 if one does not exist.at n=33A086250
• Generalized mod 3 multiplicative Jacobsthal sequence.at n=34A087462
• Generalized multiplicative Jacobsthal sequence.at n=34A087463
• Numbers of the form (4^n + 4^(n-1) + ... + 1) + (n mod 2).at n=15A088556