380160
domain: N
Appears in sequences
- Complexity of (or spanning trees in) a 3 X n grid.at n=5A006238
- a(n) = 3*2^(2*n)*(3*n)!/((2*n)!*n!).at n=4A006587
- Convolution of triangular numbers with partition numbers.at n=27A086716
- Sum of the non-unitary divisors of A064115(n) (or of 1+A064115(n)).at n=12A103846
- Square array read by antidiagonals: T(m,n) = number of spanning trees in an m X n grid.at n=30A116469
- Square array read by antidiagonals: T(m,n) = number of spanning trees in an m X n grid.at n=33A116469
- Number of spanning trees in the graph P_6 x P_n.at n=2A139400
- Fourth left hand column of the RSEG2 triangle A161739.at n=7A161743
- G.f. satisfies: A(x) = x + A( 4*A(x)^4 )^(1/2).at n=8A177408
- Number of domino tilings of the 5 X n grid with upper left corner removed iff n is odd.at n=11A189003
- Number of domino tilings of the 11 X n grid with upper left corner removed iff n is odd.at n=5A210724
- Totients whose inverses contain two or more consecutive tetrahedral pyramidal numbers.at n=7A318988
- Number of spanning trees in the k_1 X ... X k_j grid graph, where (k_1 - 1, ..., k_j - 1) is the partition with Heinz number n.at n=32A338832
- a(n) = product of nonzero entries in row n of A235791.at n=32A339577
- a(n) = [x^n] -3/(2*x - 1)^5.at n=8A344564
- Integers x such that sigma(x)^2 - 3*x^2 is a square.at n=19A385810
- a(n) = n*(n-1)*(n- 2)^2*2^(n-4)/3.at n=10A391778