768768

Appears in sequences

• a(n) = 2^n*C(n+6,6). Number of 6D hypercubes in an (n+6)-dimensional hypercube.at n=8A002409
• a(n) = 2^(n-4)*(n+2)*(n+3)*(n+4)*(n+5)*(n+6)/15.at n=9A080952
• Expansion of (1-8*x)^(-3/2).at n=6A115902
• Triangle T(n,m) read by rows: let p(n,x) = exp(-x) * Sum_{m >= 0} (2*m + 1)^n * x^m/m!; then T(n,m) = [x^m] p(n,x).at n=39A154537
• Number of (n+2)X(n+2) symmetric binary matrices without the pattern 1 1 1 diagonally.at n=3A190419
• 5-quantum transitions in systems of N>=5 spin 1/2 particles, in columns by combination indices.at n=21A213347
• 6-quantum transitions in systems of N >= 6 spin 1/2 particles, in columns by combination indices.at n=20A213348
• Product of tribonacci numbers A000073(2) * ... * A000073(n).at n=7A254231
• Number of unordered pairs of disjoint self-avoiding paths with nodes that cover all vertices of a convex n-gon; one node paths are not allowed.at n=13A308914
• Maximum number of ways in which a set of integer-sided squares can tile an n X 3 rectangle.at n=21A362144
• Maximum number of ways in which a set of integer-sided squares can tile an n X 3 rectangle, up to rotations and reflections.at n=23A362261
• Riordan array ((1-x)^(m-1), x/(1-x)) with factor r^(2*n) on row n, for m = 3/2, r = 2.at n=39A380851