1431655765

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=31A000975
• 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=32A001045
• Sierpiński's triangle (Pascal's triangle mod 2) converted to decimal.at n=30A001317
• a(n) = (4^n - 1)/3.at n=16A002450
• Divisors of 2^32 - 1 (for a(1) to a(31), the 31 regular polygons with an odd number of sides constructible with ruler and compass).at n=30A004729
• Smallest start for a '3x+1' sequence containing 2^n.at n=32A010120
• Smallest start for a '3x+1' sequence containing 2^n.at n=31A010120
• a(n) = C(n,0) + C(n,3) + ... + C(n,3[n/3]).at n=32A024493
• a(n) = C(n,2) + C(n,5) + ... + C(n, 3*floor(n/3)+2).at n=32A024495
• a(n) = Sum_{k=0..floor(n/2)} A026637(n, k).at n=31A026645
• One-dimensional cellular automaton 'sigma-minus' (Rule 90): 000,001,010,011,100,101,110,111 -> 0,1,0,1,1,0,1,0.at n=15A038183
• Odd values of n for which a regular n-gon can be constructed by compass and straightedge.at n=29A045544
• Expansion of 1/((1 - x)*(1 - 2*x)*(1 + 2*x)).at n=31A052992
• Expansion of 1/((1 - x)*(1 - 2*x)*(1 + 2*x)).at n=30A052992
• Smallest number whose Euler totient is divisible by 2^n.at n=30A053576
• a(n) = Sum_{1<=k<=n, gcd(k,n)=1} 2^(k-1).at n=31A054432
• Smallest number to give 2^(2n) in a hailstone (or 3x + 1) sequence.at n=15A054646
• a(n) = (2^n - 1)/product(2^p - 1) where the product is over all distinct primes p that divide n.at n=31A055515
• Number of 16 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.at n=0A069320
• List of codewords in binary lexicode with Hamming distance 16 written as decimal numbers.at n=16A075964