1370880
domain: N
Appears in sequences
- a(n) = n!*Fibonacci(n+1).at n=8A005442
- A triangle related to A000045 (Fibonacci numbers).at n=36A039948
- Numbers that can be written as (a^2-1)(b^2-1) in three or more distinct ways.at n=14A134856
- Triangle T(n,k) read by rows: the coefficient [x^k] of the polynomial (n-1)! *sum_{i=0..n} Fibonacci(i)*binomial(x,n-i), read by rows, 0<=k<n.at n=36A139167
- Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^3 = I.at n=5A162804
- Triangle S(n,k) by rows: coefficients of 4^((n-1)/2)*(x^(1/4)*d/dx)^n when n is odd, and of 4^(n/2)*(x^(3/4)*d/dx)^n when n is even.at n=45A223170
- Triangle S(n,k) by rows: coefficients of 4^(n/2)*(x^(3/4)*d/dx)^n when n=0,2,4,6,...at n=25A223528
- Square array read by antidiagonals, A(n,k) = k!*[x^k]((1-Sum_{j=1..n} x^j)^(-1)), (n>=0,k>=0).at n=63A247504
- a(n) = A000111(n) * A000142(n). Row sums of A373434.at n=7A373433
- Obverse convolution (n)**(2^n); see Comments.at n=5A374859
- a(n) = Sum_{permutations p of [n]} des(p^2), where des(p) is the number of descents of p.at n=8A385366
- Vandermonde determinant of the divisors of n.at n=34A389552