7257600
domain: N
Appears in sequences
- a(n) = (n+1)!/LCM{1,3,6,...,C(n+1,2)}.at n=13A025557
- Square array a(n,k) read by antidiagonals: a(n,1)=n, a(1,k)=k, a(n,k) = a(n-1,k-1)*a(n-1,k)*a(n,k-1).at n=29A047675
- Row 2 of square array defined in A047675: 2*n!*(n+1)!.at n=6A047677
- Expansion of e.g.f. (2 + x)/(1 - x^2).at n=10A052566
- E.g.f. (1-x)/(1-x-x^5).at n=10A052627
- Expansion of e.g.f. (2+x^3-x^4)/(1-x).at n=10A052628
- Expansion of e.g.f. x^2*(2+x-x^2)/(1-x).at n=10A052642
- E.g.f. 2*x^2*(1+x-x^2)/(1-x).at n=10A052645
- Expansion of e.g.f. 2*x^4/(1-x).at n=10A052683
- a(0) = 0; a(n) = 2*n! (n >= 1).at n=10A052849
- Square root of largest square dividing n!.at n=19A055772
- Square root of largest square dividing n!.at n=20A055772
- a(n) = A056622(n!).at n=19A056627
- Triangle read by rows: T(n,k) (n >= 2, 1<=k<=n-1) is the number of permutations p of 1,...,n with max(|p(i)-p(i-1)|, i=2..n) = k.at n=54A064482
- Number of adjacent pairs of form (odd,odd) among all permutations of {1,2,...,n}.at n=9A077611
- Number of adjacent pairs of form (even,even) among all permutations of {1,2,...,n}.at n=9A077612
- The Hirzebruch numbers. a(n) = Product_{2 <= p <= n+1, p prime} p^floor(n / (p - 1)).at n=9A091137
- Expansion of e.g.f. (1+x)/(1-x).at n=10A098558
- Product_{k=1..n} prime(k)!.at n=4A111180
- Numbers k such that k^2 contains exactly 2 copies of each digit of k.at n=23A114258