cp's OEIS Frontend

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.

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).

Original entry on oeis.org

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, 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, 1, 7, 1, 2, 1, 2, 1, 1, 1, 2, 1, 4, 3, 2, 1, 12, 1, 1
Offset: 1

Views

Author

Leroy Quet, Aug 23 2007

Keywords

Examples

			A027750: 1,1,2,1,3,1,2,4,1,5,1,2,3,6,...
The 14th term of this list is 6.
So a(14) = GCD(6,14) = 2.
		

Crossrefs

Programs

  • PARI
    for (m=1, oo, fordiv (m, d, print1 (gcd(d, n++) ", "); if (n==86, break (2)))) \\ Rémy Sigrist, Feb 06 2019

Extensions

More terms from Rémy Sigrist, Feb 06 2019