36309

Appears in sequences

• a(n) = 49*(n-1)*(n-2)/2.at n=37A027469
• Number of n-node planar graphs with minimum degree at least 5.at n=22A049373
• Multiples of 1729, the Hardy-Ramanujan number.at n=21A138129
• a(n) = binomial(n+1,2)*7^2.at n=38A162942
• Vandermonde sequence using x^2 + xy + y^2 applied to the first n primes.at n=2A203703
• Number of rooted binary leaf-multilabeled trees with n leaves on the label set [3].at n=7A220820
• a(n) is the smallest m such that A001414(m)=n and ((m=0) mod n) and m/n is both squarefree and prime to n, or 0 if no such m exists.at n=47A267000
• Number of n X 3 0..1 arrays with every element equal to 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero.at n=20A298141
• Triangle read by rows: T(n,k) is the number of binary rooted trees with n leaves of exactly k colors and all non-leaf nodes having out-degree 2.at n=30A319541
• Number of unlabeled loopless multigraphs with n edges covering four vertices.at n=36A328652
• a(n) is the smallest number that has exactly n odious divisors (A000069).at n=16A355968
• Odd spoof k-perfect numbers of order <= 10.at n=5A389834