30305

Appears in sequences

• Number of spanning trees in P_5 x P_n.at n=2A003779
• Complexity of (or spanning trees in) a 3 X n grid.at n=4A006238
• Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 12.at n=30A031690
• Multiples of 11 with digit sum 11, with no zero digits in odd places.at n=27A083512
• Square array read by antidiagonals: T(m,n) = number of spanning trees in an m X n grid.at n=23A116469
• Square array read by antidiagonals: T(m,n) = number of spanning trees in an m X n grid.at n=25A116469
• a(n) = 36*n^2 + n.at n=28A157324
• a(n) = 841*n^2 + 29.at n=6A158665
• a(n) = (n^3 + 4*n^2 - n)/2.at n=37A162260
• Triangle read by rows: T(n,k) = round(c(n)/(c(k)*c(n-k))) where c are partial products of a sequence defined in comments.at n=60A172358
• Number of domino tilings of the 5 X n grid with upper left corner removed iff n is odd.at n=9A189003
• Number of domino tilings of the 9 X n grid with upper left corner removed iff n is odd.at n=5A189005
• Triangle T(n,k) represents the coefficients of (x^19*d/dx)^n, where n=1,2,3,...at n=18A223521
• Squarefree numbers which yield zero when their prime factors are xored together.at n=17A235488
• Numbers with digit sum 11 that are multiples of 11.at n=38A283742
• 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=20A338832
• Number of integer partitions of n that are neither Look-and-Say nor section-sum.at n=40A383510