a(n) = Product_{k=1..d(n)-1} gcd(b(k), b(k+1)), where b(k) is the k-th positive divisor of n and d(n) is the number of positive divisors of n.
A136179
a(n) = Product_{k=1..d(n)-1} gcd(b(k), b(k+1)), where b(k) is the k-th positive divisor of n and d(n) is the number of positive divisors of n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =1a(5) =3a(6) =1a(7) =8a(8) =3a(9) =5a(10) =1a(11) =12a(12) =1a(13) =7a(14) =5a(15) =64a(16) =1a(17) =81a(18) =1a(19) =100a(20) =7a(21) =11a(22) =1a(23) =192a(24) =5a(25) =13a(26) =27a(27) =196a(28) =1a(29) =150
External references
- oeis: A136179