5592405

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=23A000975
• 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=24A001045
• a(n) = (4^n - 1)/3.at n=12A002450
• Expansion of bracket function.at n=20A006090
• Indices of last windows of trapezoidal maps.at n=23A007873
• Smallest start for a '3x+1' sequence containing 2^n.at n=24A010120
• Smallest start for a '3x+1' sequence containing 2^n.at n=23A010120
• Gaussian binomial coefficients [ n,11 ] for q = 4.at n=1A022210
• a(n) = C(n,1) + C(n,4) + ... + C(n, 3*floor(n/3) + 1).at n=23A024494
• a(n) = C(n,2) + C(n,5) + ... + C(n, 3*floor(n/3)+2).at n=24A024495
• a(n) = Sum_{k=0..floor(n/2)} A026637(n, k).at n=23A026645
• Numbers that are repdigits in base 4.at n=34A048329
• Expansion of 1/((1 - x)*(1 - 2*x)*(1 + 2*x)).at n=23A052992
• Expansion of 1/((1 - x)*(1 - 2*x)*(1 + 2*x)).at n=22A052992
• Smallest number to give 2^(2n) in a hailstone (or 3x + 1) sequence.at n=11A054646
• a(n) = floor(8^8/n).at n=2A057070
• Table read by antidiagonals of T(n,k)=floor(n^n/k) with n,k >= 1.at n=52A057075
• Number of 12 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.at n=0A069316
• Number of integers in {1, 2, ..., 2^n} that are coprime to n.at n=23A074933
• List of codewords in binary lexicode with Hamming distance 11 written as decimal numbers.at n=19A075949