40314
domain: N
Appears in sequences
- Fibonacci numbers written in base 5.at n=18A004688
- Numbers m such that the factorizations of m..m+4 have the same number of primes (including multiplicities).at n=33A045941
- Differences of two factorial numbers.at n=26A051949
- Irregular triangle of coefficients of p(n, x) = (1 - x^2)^(n+1)*Sum_{j >= 0} (4*j+ 1)^n*x^(2*j), read by rows.at n=29A158782
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k as the last entry in the first block (1<=k<=n).at n=40A177263
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k as the first entry in the last block (1<=k<=n).at n=40A177264
- Ordered differences of factorials.at n=23A204930
- Triangle read by rows, coefficients of the generalized Eulerian polynomials A_{n, 4}(x) in descending order.at n=18A225118
- Largest number such that 2^a(n) is a divisor of (n!)!.at n=8A245087
- Triangle, read by rows, T(n,k) = t(n-k, k) where t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1) and f(n) = 2*n + 3.at n=22A257611
- Triangle, read by rows, T(n,k) = t(n-k, k) where t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1) and f(n) = 2*n + 3.at n=26A257611
- Numbers n such that n, n + 1, n + 2, n + 3 and n + 4 are products of exactly three primes.at n=31A268588
- Lexicographically earliest sequence of distinct positive integers with no finite subset summing to a factorial number (A000142).at n=37A353969
- a(n) = Sum_{k=0..floor(n/5)} (-1)^k * (n-5*k)!.at n=8A358611
- a(n) is the number of distinct values of the determinant of an n X n symmetric Toeplitz matrix having 0 on the main diagonal and all the first n-1 primes off-diagonal.at n=9A374620
- Numbers k that are less than distance j from j! for some positive integer j.at n=49A387616