516400
domain: N
Appears in sequences
- a(n) = a(n-1)*(2n-1) + 2n with a(0)=0.at n=7A093303
- a(0) = 0. If n is odd, a(n) = a(n-1) * n, otherwise a(n) = a(n-1) + n.at n=14A222559
- Number of length n+2 0..1 arrays with at most two downsteps in every n consecutive neighbor pairs.at n=34A256817
- G.f.: g(x)^2 * g(x^2), where g(x) is the g.f. of A000081.at n=18A339985