2147483650

Appears in sequences

• Number of conjugacy classes in Clifford group CL(n).at n=31A049332
• Row sums of even numbered rows of array T in A050870 (periodic binary words).at n=31A050871
• a(n) = 2^n + 2.at n=31A052548
• Inverse Moebius transform of powers of 2.at n=31A055895
• Number of elements in the continued fraction for Sum_{k=0..n} 1/2^2^k.at n=32A056469
• a(n)=2a(n-1)+a(n-2)-2a(n-3).at n=30A087288
• a(n) = A089709(n+1)/A089709(n).at n=31A089985
• a(n) = A102371(n) + n. Or, 2*A103745.at n=31A105024
• Consider the Levenshtein distance between k considered as a decimal string and k considered as a binary string. Then a(n) is the least number m such that the Levenshtein distance is n or 0 if no such number exists.at n=31A115778
• a(0) = 2, a(n) = 2^n + 2 for n>=1.at n=31A133140
• Binomial transform of [1, 5, -1, 5, -1, 5, ...]. Inverse binomial transform of A134350.at n=30A134351
• a(n) = a(n-1) + 2a(n-2).at n=31A135440
• a(1)=1. a(n) = the smallest integer >a(n-1) such that both a(n) and the number of divisors of a(n) contain the same number of 1's in their binary representations as n has when written in binary.at n=16A162955
• Numbers of the form A019434(i) + A000668(j).at n=35A168335
• Sums of two (not necessarily distinct) Mersenne primes (A000668).at n=28A171251
• Sequence defined by a(0)=a(1)=a(2)=1, a(3)=2, a(4)=6 and the formula a(n)=2^(n-2)+2 for n>=5.at n=33A174316
• Indices in A261283 where records occur.at n=34A253317
• Sierpinski tetrahedron or tetrix numbers: a(n) = 2*4^n + 2.at n=15A283070