25608

Appears in sequences

• Molien series for A_10.at n=43A008633
• Number of partitions of n into at most 10 parts.at n=43A008639
• Number of partitions of n into 10 unordered relatively prime parts.at n=43A023030
• Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 40.at n=7A031718
• Number of 4-block ordered bicoverings of an unlabeled n-set.at n=17A060091
• Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,21.at n=33A064247
• 8 times octagonal numbers: 8*n*(3*n-2).at n=33A153808
• a(n) = 64*n^2 + 8.at n=19A158488
• G.f.: A(x) = exp( 6*Sum_{n>=1} A006519(n)*A038500(n) * x^n/n ).at n=10A162583
• Number of 3 X 3 magilatin squares with positive values < n.at n=9A173548
• Number of 2-compositions of n having no increasing columns.at n=12A181306
• Values x for record minima of the positive distance d between the square of an integer y and the fifth power of a positive integer x such that d = y^2 - x^5 (x <> k^2 and y <> k^5).at n=23A198444
• a(n) = 32*7^n/21 - 8/3, n>=1.at n=4A304826
• Number of partitions of n into 10 distinct and relatively prime parts.at n=43A341914
• Place n points in general position on each side of an equilateral triangle, and join every pair of the 3*n+3 boundary points by a chord; sequence gives number of vertices in the resulting planar graph.at n=10A367117