5489031744

Appears in sequences

• Powers of 42.at n=6A009986
• a(n) = (2*n)^6.at n=21A016746
• a(n) = (3*n)^6.at n=14A016770
• a(n) = (4*n+2)^6.at n=10A016830
• a(n) = (5*n + 2)^6.at n=8A016878
• a(n) = (6*n)^6.at n=7A016914
• a(n) = (7*n)^6.at n=6A016986
• a(n) = (8*n + 2)^6.at n=5A017094
• a(n) = (9*n + 6)^6.at n=4A017238
• a(n) = (10*n + 2)^6.at n=4A017298
• a(n) = (11*n + 9)^6.at n=3A017502
• a(n) = (12*n + 6)^6.at n=3A017598
• Triangle read by rows: T(n,k) = (k*n)^k, 0 <= k <= n.at n=34A155955
• a(n) = n^n * (n+1)^n.at n=5A174881
• a(n) = sigma(n)^tau(n), where tau(n) = A000005(n) = the number of divisors of n and sigma(n) = A000203(n) = the sum of divisors of n.at n=19A236287
• a(n) = (n*(n+1))^6.at n=6A249076
• Product of squares of proper divisors of n.at n=41A277169
• Number of harmonious graphs with n edges and at most n vertices, allowing self-loops.at n=11A340234