209715

Appears in sequences

• Expansion of (1-x)/(1-2*x+x^2-2*x^3).at n=19A007909
• Expansion of 1/((1-2*x)*(1+x^2)).at n=18A007910
• a(n) = 3*a(n-1) + 4*a(n-2), a(0) = 0, a(1) = 1.at n=10A015521
• Fibonacci sequence beginning 0, 31.at n=20A022365
• Numbers whose set of base-16 digits is {3,4}.at n=30A032840
• Every run length in base 2 is 2.at n=8A043291
• Expansion of 1/((1-x)*(1-2*x)*(1+x^2)).at n=17A077854
• Expansion of 1/(1-x+2*x^3).at n=39A077950
• Start with the sequence [1, 1/2, 1/3, ..., 1/n]; form new sequence of n-1 terms by taking averages of successive terms; repeat until reach a single number F(n); a(n) = numerator of F(n).at n=19A090633
• a(n) is the smallest positive integer k such that, if kn is written in base 2, it requires exactly n ones.at n=19A102032
• Decimal equivalent of number defined by last k bits of the infinite binary string ...0011001100110011 (numbers with leading zeros omitted).at n=9A112627
• Row sums of triangle A118407.at n=38A118408
• Triangle read by rows: (1/5) * (A007318^4 - A007318^(-1)) as infinite lower triangular matrices.at n=45A131050
• a(n) = 2*a(n-1) - a(n-2) + 2*a(n-3).at n=18A133190
• a(n) = 3*a(n-1) + 4*a(n-2) - a(n-3) + 3*a(n-4) + 4*a(n-5).at n=9A135343
• a(n) = 3*a(n-1) + 4*a(n-2) - a(n-3) + 3*a(n-4) + 4*a(n-5).at n=9A135345
• a(n)=-a(n-1)+2a(n-3).at n=35A137426
• a(n)=-a(n-1)+2a(n-3).at n=40A137426
• Numbers 2*k+1 for which numbers A006694(k) are record values for A006694.at n=41A139208
• a(n) = (16^n - 1)/5.at n=5A182512