38160

Appears in sequences

• Number of series-reduced planted trees with n+9 nodes and 4 internal nodes.at n=43A001860
• Number of paraffins (see Losanitsch reference for precise definition).at n=22A006010
• Series for second perpendicular moment of square lattice.at n=14A006734
• Expansion of Jacobi theta constant (theta_2/2)^12.at n=11A014787
• Weight distribution of [ 48,17,12 ] dual Rao-Reddy code.at n=12A031136
• Numbers k whose decimal representation, read as a base-24 value and divided by k, yields an integer.at n=18A032579
• Low-temperature susceptibility expansion for honeycomb net (Potts model, q=4).at n=5A057395
• n times n+6 gives the concatenation of two numbers m and m-4.at n=2A116262
• a(n) = 5*n^5 - 3*n^3 - 2*n^2.at n=6A134630
• Number of nX6 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 0 and 1 1 1 vertically.at n=4A207893
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 0 and 1 1 1 vertically.at n=49A207895
• Number of 5Xn 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 0 and 1 1 1 vertically.at n=5A207898
• Number of (n+1)X(4+1) 0..1 arrays with no element having a strict majority of its horizontal, diagonal and antidiagonal neighbors equal to one.at n=2A231760
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with no element having a strict majority of its horizontal, diagonal and antidiagonal neighbors equal to one.at n=17A231764
• Number of (3+1)X(n+1) 0..1 arrays with no element having a strict majority of its horizontal, diagonal and antidiagonal neighbors equal to one.at n=3A231767
• Number of (n+2) X (1+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001001.at n=9A260287
• Number of minimum dominating sets in the n X n black bishop graph.at n=13A323500
• Number of minimum dominating sets in the n X n white bishop graph.at n=12A323501
• Triangle read by rows: T(n,k) is the number of oriented series-parallel networks whose multigraph has n edges and k interior vertices, 0 <= k < n.at n=61A339231
• Number of ways to write n as an ordered sum of 10 squares of positive integers.at n=52A340947