357913941

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=29A000975
• 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=30A001045
• a(n) = (4^n - 1)/3.at n=15A002450
• Expansion of bracket function.at n=26A006090
• Smallest start for a '3x+1' sequence containing 2^n.at n=30A010120
• Smallest start for a '3x+1' sequence containing 2^n.at n=29A010120
• Number of Barlow packings with group P3(bar)m1(SO) that repeat after 2n-1 layers.at n=30A011950
• a(n) = C(n,1) + C(n,4) + ... + C(n, 3*floor(n/3) + 1).at n=29A024494
• a(n) = C(n,2) + C(n,5) + ... + C(n, 3*floor(n/3)+2).at n=30A024495
• a(n) = Sum_{k=0..floor(n/2)} A026637(n, k).at n=29A026645
• Expansion of 1/((1 - x)*(1 - 2*x)*(1 + 2*x)).at n=28A052992
• Expansion of 1/((1 - x)*(1 - 2*x)*(1 + 2*x)).at n=29A052992
• Smallest number to give 2^(2n) in a hailstone (or 3x + 1) sequence.at n=14A054646
• Number of 15 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.at n=0A069319
• Partial sums of Jacobsthal gap sequence.at n=29A080610
• Jacobsthal reverse-pair sequence.at n=29A084183
• a(n) = -5*a(n-1)-4*a(n-2) with n>1, a(0)=0, a(1)=1.at n=15A084241
• a(n) is the index of F(n+1) at the unique occurrence of the ordered pair of reversed consecutive terms (F(n+1),F(n)) in Stern's diatomic sequence A002487, where F(k) denotes the k-th term of the Fibonacci sequence A000045.at n=28A086893
• Generalized Jacobsthal sequence.at n=29A087629
• Numbers of the form (4^n + 4^(n-1) + ... + 1) + (n mod 2).at n=13A088556