Highest common factor (or GCD) of n^n and hyperfactorial(n-1), i.e., gcd(n^n, product(k^k) for k < n).
A056582
Highest common factor (or GCD) of n^n and hyperfactorial(n-1), i.e., gcd(n^n, product(k^k) for k < n).
Terms
- a(0) =1a(1) =1a(2) =4a(3) =1a(4) =1728a(5) =1a(6) =65536a(7) =19683a(8) =3200000a(9) =1a(11) =1a(12) =13492928512a(15) =1a(17) =1
External references
- oeis: A056582