66976

Appears in sequences

• Minimal covering numbers.at n=38A160559
• Numbers whose square is the product of a number and its reverse.at n=24A207373
• a(n) = 4*(n + 1)*(n + 2)*(4*n + 3)/3.at n=22A267522
• Non-palindromes numbers not ending in 0 whose square is the product of a number and its reverse in only one way.at n=15A325151
• Number of distinct intersections among all circles that can be constructed on vertices of an n-sided regular polygon, using only a compass.at n=25A331702
• Numbers k that divide the k-th Franel number.at n=35A372940
• 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=31A381058