24038
domain: N
Appears in sequences
- a(n) = n + n*(n-1)*(n-2)*(n-3).at n=14A001094
- Row sums of A154685.at n=27A151675
- Number of (n+5) X 1 arrays of occupancy after each element moves up to +-5 places including 0.at n=3A222342
- T(n,k)=Number of length (n+k)X1 arrays of occupancy after each element moves up to +-k places including 0.at n=31A222345
- Number of (n+4)X1 arrays of occupancy after each element moves up to +-n places including 0.at n=4A222348
- Number of length 2+3 0..n arrays with every four consecutive terms having the maximum of some two terms equal to the minimum of the remaining two terms.at n=12A249708
- a(n) = A007678(2*n)/(2*n).at n=42A341734
- Triangle read by rows. Number T(n, k) of partitions of the multiset [1, 1, 1, 2, 2, 2, ..., n, n, n] into k nonempty subsets, for 3 <= k <= 3n.at n=45A360037
- Products k of 4 distinct primes (or tetraprimes) such that k has no squarefree neighbors.at n=38A364141
- Products k of 4 distinct primes (or tetraprimes) such that none of k-2, k-1, k+1 and k+2 is squarefree.at n=15A364766
- G.f.: Sum_{k>=0} x^(k*(k+1)) / Product_{j=1..k} (1 - x^(2*j-1))^2.at n=52A376622