11184811

Appears in sequences

• 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=25A001045
• a(2*n) = 2*a(2*n-1), a(2*n+1) = 2*a(2*n)-1.at n=25A005578
• a(n) = (2^(2*n + 1) + 1)/3.at n=12A007583
• a(n) = C(n,0) + C(n,3) + ... + C(n,3[n/3]).at n=25A024493
• a(n) = C(n,1) + C(n,4) + ... + C(n, 3*floor(n/3) + 1).at n=24A024494
• 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=25A064086
• Let u(1)=u(2)=u(3)=2, u(n)=(1+u(n-1)u(n-2))/u(n-3); then a(n) is the numerator of u(n).at n=26A076737
• Expansion of 1/((1-x)*(1+2*x)).at n=24A077925
• 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=25A079665
• 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=24A081374
• A Jacobsthal sequence trisection.at n=8A082311
• Jacobsthal reverse-pair sequence.at n=26A084183
• Generalized mod 3 multiplicative Jacobsthal sequence.at n=25A087462
• Generalized multiplicative Jacobsthal sequence.at n=25A087463
• Pair reversal of Jacobsthal numbers.at n=24A092808
• Least integer value of (1 + 2^n + 3^n + ... + k^n)/(1 + 2 + 3 + ... + k), k > 1.at n=24A094755
• Expansion of (1 - 2*x + 2*x^2)/((1 - x^2)*(1 - 2*x)).at n=24A097072
• E.g.f. (1/cosh(x)+tanh(x))*(exp(2*x)-exp(-x))/3.at n=25A101480
• Column 2 of the array in A107735.at n=23A107733
• Numbers of the form (2^(i*j)-1)/((2^i-1)*(2^j-1)) where gcd(i,j) = 1.at n=24A112674