44473

Appears in sequences

• Central factorial numbers: A008955(n,3).at n=3A000597
• Number of points of norm <= n in cubic lattice.at n=22A000605
• Central factorial numbers: 3rd subdiagonal of A008955.at n=3A001821
• Eighth column of quadrinomial coefficients.at n=10A001919
• Triangle of central factorial numbers |t(2n,2n-2k)| read by rows.at n=24A008955
• cosh(arcsin(x)*exp(x))=1+1/2!*x^2+6/3!*x^3+29/4!*x^4+140/5!*x^5...at n=8A012325
• s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = A000201 (lower Wythoff sequence).at n=29A024464
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = A000201 (lower Wythoff sequence).at n=28A025084
• Values of k such that {P(k), P(k+1), ..., P(k+6)} are all prime numbers, where P(k) = 4*k^2 - 154*k + 1523.at n=56A090111
• Central terms of the triangle of central factorial numbers (A008955).at n=3A234324
• Triangle read by rows: T(n,k) (n>=1, 0<=k<n) is the number of permutations of n things that require k stack-sorts.at n=38A262494
• Triangle read by rows, Stirling cycle numbers of order 2, T(n, n) = 1, T(n, k) = 0 if k < 0 or k > n, otherwise T(n, k) = T(n-1, k-1) + (n-1)^2*T(n-1, k), for 0 <= k <= n.at n=32A269944
• Analog of A265434 that counts only primitive words.at n=24A276408