29877

Appears in sequences

• a(n) = T(2n,n-1), T given by A026670. Also T(2n,n-1)=T(2n+1,n+2), T given by A026725; and T(2n,n-1), T given by A026736.at n=7A026672
• a(n) = greatest number in row n of array T given by A026736.at n=16A027214
• Expansion of 1/sqrt(1 - 2*x + 9*x^2).at n=11A098332
• Numbers k such that the first 9 decimal digits of the k-th Fibonacci number is 1-9 pandigital.at n=17A112516
• Number of (n+2) X 6 0..3 arrays with every 3 X 3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly three ways, and new values 0..3 introduced in row major order.at n=7A204638
• Numbers n such that 3^7*2^n - 1 is prime.at n=33A230537
• a(n) = Sum_{k=0..3} binomial(6,k)*binomial(n,k).at n=21A247608
• Start with 209; if even, divide by 2; if odd, add the next three primes: Trajectory of 209 under iterations of A174221, the "PrimeLatz" map.at n=38A293981
• Number of nX4 0..1 arrays with every element unequal to 1, 2, 3, 4, 6 or 8 king-move adjacent elements, with upper left element zero.at n=4A316379
• Number of nX5 0..1 arrays with every element unequal to 1, 2, 3, 4, 6 or 8 king-move adjacent elements, with upper left element zero.at n=3A316380
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 3, 4, 6 or 8 king-move adjacent elements, with upper left element zero.at n=31A316383
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 3, 4, 6 or 8 king-move adjacent elements, with upper left element zero.at n=32A316383