793152
domain: N
Appears in sequences
- Number of pairs of cycles of cardinality at least 3.at n=10A052519
- Number of 2-step self-avoiding walks on an n X n X n X n 4-cube summed over all starting positions.at n=17A188785
- G.f. S(x) satisfies: C(C(x)) + S(S(x)) = x such that C(x)^3 + (3/2)*S(x)^3 = x^3.at n=7A192072
- Number of (n+1) X 3 0..3 arrays with every 2 X 3 or 3 X 2 subblock having an equal number of clockwise and counterclockwise edge increases.at n=2A206746
- Number of (n+1) X 4 0..3 arrays with every 2 X 3 or 3 X 2 subblock having an equal number of clockwise and counterclockwise edge increases.at n=1A206747
- T(n,k) = number of (n+1) X (k+1) 0..3 arrays with every 2 X 3 or 3 X 2 subblock having an equal number of clockwise and counterclockwise edge increases.at n=7A206752
- T(n,k) = number of (n+1) X (k+1) 0..3 arrays with every 2 X 3 or 3 X 2 subblock having an equal number of clockwise and counterclockwise edge increases.at n=8A206752
- Fourier coefficients of the modular form (1/t_{3A}) * sqrt(1 - 108/t_{3A}) * F_{3A}^10.at n=24A341555
- a(n) = n! * Sum_{k=1..n} ( Sum_{d|k} (-1)^(k/d + 1) ) /k.at n=8A356389