67919
domain: N
Appears in sequences
- Rectangular array R read by antidiagonals: R(n,k) = F(n+1)^k - k*F(n-1)*F(n)^(k-1), where F(n) = A000045(n), the n-th Fibonacci number; n >= 0, k >= 1.at n=59A318405
- a(n) = Sum_{k=1..n+1} (-1)^(k - 1)*(k + 1)*(n - k + 1)!.at n=7A374652
- Number of length n words on the alphabet {a,b,c,d,e} that do not contain exactly one a and exactly one b.at n=7A387680