2240000
domain: N
Appears in sequences
- Number of permutations p of (1,2,3,...,n) such that k+p(k) is a Fibonacci number for 1 <= k <= n.at n=53A097082
- Triangle read by rows: T(n,k)=binomial(n,k-1)*k^(k-1)*(n+1-k)^(n-k) (1<=k<=n).at n=31A103690
- Terms in A003325 which are sum of three subsequent terms in A003325.at n=25A145755
- E.g.f. satisfies: A(x,y) = exp(x*y*exp(x*A(x,y))).at n=40A161552
- E.g.f.: A(x,y) = LambertW(x*y*exp(x))/(x*y*exp(x)), as a triangle of coefficients T(n,k) = [x^n*y^k/n! ] A(x,y), read by rows.at n=40A161628
- Triangular array read by rows. T(n,k) is the number of partial functions on n labeled objects in which the domain of definition contains exactly k elements such that for all i in {1,2,3,...}, (f^i)(x) is defined.at n=40A185390
- Triangle read by rows: terms of a binomial decomposition of 1 as Sum(k=0..n)T(n,k).at n=40A244119
- a(n) = (n+1/3)^n * (3*n)!/n!.at n=3A362292