259328
domain: N
Appears in sequences
- 1 + Sum_{n >= 1} Sum_{k = 0..n-1} (-1)^n*T(n,k)*y^(2*k)*x^(2*n)/(2*n)! = JacobiCN(x,y).at n=19A060627
- Half the number of permutations of 0..n with exactly two maxima.at n=10A100575
- a(n) = Sum_{k=1..9} a(n-k); a(8) = 1, a(n) = 0 for n < 8.at n=27A104144
- Triangle T(n, k) = 2^(k-1) * E(n, k-1) where E(n,k) are the Eulerian numbers A173018, read by rows.at n=53A142075
- The number of zeroless decimal numbers whose digital sum is n.at n=19A258800
- Number of compositions (ordered partitions) of n into parts not greater than n/2.at n=19A368484