533610
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) is the number of set partitions of {1,2,...,n} (or of any n-set) having k blocks of even size (0<=k<=floor(n/2)).at n=46A124322
- Coefficients of mock modular form H_3^(4) (divided by 2).at n=25A256053
- Number of (n+1) X (3+1) arrays of permutations of 0..n*4+3 with each element having index change +-(.,.) 0,0 1,-2 or 2,-1.at n=5A264123
- Number of (n+1)X(6+1) arrays of permutations of 0..n*7+6 with each element having index change +-(.,.) 0,0 1,-2 or 2,-1.at n=2A264126
- T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 1,-2 or 2,-1.at n=30A264128
- T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 1,-2 or 2,-1.at n=33A264128
- a(n) = Sum_{k=1..n} Sum_{z=1..n} Sum_{y=1..n} Sum_{x=1..n} [GCD(f(x,y,z), n) = k] * f(x,y,z) * A023900(k), where f(x,y,z) = x^2 + y^2 - z^2.at n=32A373582