26215

Appears in sequences

• Expansion of (1-x)/(1-2*x+x^2-2*x^3).at n=16A007909
• dot_product(n,n-1,...2,1)*(6,7,...,n,1,2,3,4,5).at n=43A026063
• a(n) = T(n,0) + T(n,1) + ... + T(n,n), T given by A026519.at n=12A026531
• a(n) = T(n,0) + T(n,1) + ... + T(n,n), T given by A026536.at n=12A026548
• a(n) = ceiling(2^(n-1)/n).at n=19A053637
• Grundy function for turn-at-most-9-coins game.at n=17A054046
• Positions of check bits in code in A075946.at n=2A075948
• Expansion of (1-x)^(-1)/(1-x+2*x^3).at n=32A077870
• Duplicate of A007909.at n=16A078000
• a(n) = 3*a(n-1) + 4*a(n-2), a(0)=a(1)=1.at n=8A102900
• a(n) = a(n-1) + 2^(k(n)), where k(n) is the n-th term of the sequence formed by k(1)=0 together with the numbers A042963.at n=8A113870
• Row sums of triangle A118407.at n=33A118408
• Inverse binomial transform of 1, 2, 2, 4, 10, 20, ... = A100088.at n=30A137470
• Inverse binomial transform of 1, 2, 2, 4, 10, 20, ... = A100088.at n=32A137470
• Inverse binomial transform of 1, 2, 2, 4, 10, 20, ... = A100088.at n=33A137470
• Number of n-step one-sided prudent walks, avoiding single west steps and single east steps.at n=15A190569
• The subsequence A247649(2^n-1).at n=14A255490
• Expansion of -x^2*(x^3+x-1) / ((x-1)*(x+1)*(2*x-1)*(x^2+1)).at n=17A256494
• Number of (n+2) X (1+2) 0..1 arrays with each row and column divisible by 5, read as a binary number with top and left being the most significant bits.at n=14A262267
• Decimal representation of the n-th iteration of the "Rule 214" elementary cellular automaton starting with a single ON (black) cell.at n=7A267805