This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A132588 #9 Feb 06 2019 15:46:23 %S A132588 1,1,1,1,1,1,1,4,1,5,1,2,1,2,1,1,1,2,1,4,1,1,1,1,1,1,1,1,1,1,1,1,1,2, %T A132588 1,1,1,1,1,1,1,1,1,1,15,1,1,4,1,2,1,1,1,2,1,2,3,2,1,1,1,2,1,1,5,2,1,1, %U A132588 1,7,1,2,1,2,1,1,1,2,1,4,3,2,1,12,1,1 %N A132588 Let b(k) be the k-th term of the flattened irregular array where the m-th row contains the positive divisors of m (b(k) = A027750(k)). Then a(n) = gcd(b(n), n). %H A132588 Rémy Sigrist, <a href="/A132588/b132588.txt">Table of n, a(n) for n = 1..10000</a> %e A132588 A027750: 1,1,2,1,3,1,2,4,1,5,1,2,3,6,... %e A132588 The 14th term of this list is 6. %e A132588 So a(14) = GCD(6,14) = 2. %o A132588 (PARI) for (m=1, oo, fordiv (m, d, print1 (gcd(d, n++) ", "); if (n==86, break (2)))) \\ _Rémy Sigrist_, Feb 06 2019 %Y A132588 Cf. A132587, A132589, A027750. %K A132588 nonn %O A132588 1,8 %A A132588 _Leroy Quet_, Aug 23 2007 %E A132588 More terms from _Rémy Sigrist_, Feb 06 2019