19776

Appears in sequences

• Number of irreducible alternating Euler sums of depth 6 and weight 6+2n.at n=23A011796
• Number of squares (of another matrix) in the group GL(2,Z_n) described in sequence A000252.at n=34A068516
• Number of configurations of the 3-dimensional 3 X 3 X 3 sliding cube puzzle that require a minimum of n moves to be reached, starting with the empty space in the center of the combination cube.at n=8A090574
• Ulam's spiral (SSW spoke).at n=35A143838
• a(n) = 4*a(n-1) + 4*a(n-2) for n > 1; a(0) = 1, a(1) = 8.at n=6A164545
• Number of ways to choose n positive integers less than or equal to 2n such that none of the n integers divides another.at n=34A174094
• Number of ways to choose n positive integers less than or equal to 2n such that none of the n integers divides another.at n=35A174094
• a(n) = n!/2-(-2)^(n-2)*(n-2).at n=8A186639
• The number of sets of n positive integers strictly less than 2*n such that no integer in the set divides another.at n=35A192298
• Number of (n+1)X6 0..1 arrays with the number of rightwards and downwards edge increases in each 2X2 subblock differing from the number in all its horizontal and vertical neighbors.at n=12A205069
• E.g.f. satisfies: A'(x) = (1 + x*A(x))*(1 + 2*x*A(x)).at n=7A233537
• Self-convolution of A265264.at n=11A265265
• Numbers of ways of placing the numbers 1, ..., n on a circle (not counting rotations and reflections) such that for each s in {1, ..., n(n+1)/2}, there exists a connected subset S of the circle such that the numbers covered by S add up to s.at n=10A272135
• Number of n X 3 0..1 arrays with no 1 equal to more than three of its horizontal, diagonal and antidiagonal neighbors.at n=4A283852
• T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than three of its horizontal, diagonal and antidiagonal neighbors.at n=25A283857
• Number of 5Xn 0..1 arrays with no 1 equal to more than three of its horizontal, diagonal and antidiagonal neighbors.at n=2A283861
• Sum of all the parts in the partitions of n into 5 squarefree parts.at n=48A308839
• E.g.f.: S(x,q) = Integral C(x,q) * C(q*x,q) dx, such that C(x,q)^2 - S(x,q)^2 = 1, where S(x,q) = Sum_{n>=0} sum_{k=0..n*(n+1)/2} T(n,k)*x^n*y^k/n!, as an irregular triangle of coefficients T(n,k) read by rows.at n=34A322219
• Number of minimum total dominating sets in the n X n knight graph.at n=14A323549
• Irregular triangle read by rows: T(n,k) (n >= 1, k >= n+1) is the number of cells with k vertices in the dissection of an n-dimensional cube by all the hyperplanes that pass through any n vertices.at n=10A333543