19168

Appears in sequences

• Number of points on surface of truncated tetrahedron: a(n) = 14*n^2 + 2 for n > 0, a(0)=1.at n=37A005905
• Expansion of (theta_3(z)*theta_3(11z) + theta_2(z)*theta_2(11z))^4.at n=21A028612
• XOR-convolution of squares A000290 with themselves.at n=31A033460
• Numbers whose base-5 representation contains exactly three 1's and three 3's.at n=31A045247
• Numbers whose trajectory under the Esucarys map ends at the fixed point 247.at n=25A129133
• Total sum of repeated parts in all partitions of n.at n=24A194544
• G.f.: Sum_{n>=0} x^n * Sum_{k=0..n} binomial(n,k)^2 * x^k/(1-x)^k.at n=11A217661
• T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=22A281693
• Number of 2Xn 0..2 arrays with no element equal to more than one of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=5A281694
• Irregular triangular array read by rows. Let S_n be the set of labeled graphs G on [n] with 2-colored nodes where black nodes are only connected to white nodes and vice versa. Orient the edges in each such graph G from black to white. T(n,k) is the number of graphs in S_n containing exactly k descents, n>=0, 0<=k<=A002620(n).at n=53A381058