44995

Appears in sequences

• Apply partial sum operator 4 times to Fibonacci numbers.at n=16A014166
• a(n) = T(2n+1, n+2), T given by A027948.at n=8A027954
• Numbers k such that k and k^2 use only the digits 0, 2, 4, 5 and 9.at n=46A136901
• Number of binary words of length n containing at least one subword 100001 and no subwords 10^{i}1 with i<4.at n=38A143284
• a(n) = Sum_{k=0..n} (2^k + 2) * (2^k + 3) / 2.at n=8A346375
• a(n) = Sum_{k=1..n} binomial(floor(n/k)+4,5).at n=19A365439