67047424
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=34A060627
- Half the number of permutations of 0..n with exactly two maxima.at n=14A100575
- Fibonacci 13-step numbers.at n=39A168084
- a(n) is the smallest Fibonacci n-step number with exactly n prime factors (counted with multiplicity).at n=11A359880
- Number of compositions (ordered partitions) of n into parts not greater than n/2.at n=27A368484