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.

A066262 a(n) = gcd(n, A066260(n)).

Original entry on oeis.org

1, 2, 3, 4, 1, 6, 1, 8, 9, 2, 1, 12, 1, 2, 3, 16, 1, 18, 1, 4, 3, 2, 1, 24, 1, 2, 27, 4, 1, 6, 1, 32, 3, 2, 1, 36, 1, 2, 3, 8, 1, 6, 1, 4, 9, 2, 1, 48, 1, 2, 3, 4, 1, 54, 5, 8, 3, 2, 1, 12, 1, 2, 9, 64, 1, 6, 1, 4, 3, 2, 1, 72, 1, 2, 3, 4, 1, 6, 1, 16, 81, 2, 1, 12, 1, 2, 3, 8, 1, 18, 1, 4, 3, 2, 5, 96
Offset: 1

Views

Author

Reinhard Zumkeller, Dec 10 2001

Keywords

Comments

Same as A065331 through a(54); A065331(55)=1, but a(55)=5. - Jon E. Schoenfield, Jan 28 2022

Crossrefs

Cf. A066260.
Different from A065331.

Programs

  • PARI
    Composite(n) = { my(k=n + primepi(n) + 1); while (k != n + primepi(k) + 1, k = n + primepi(k) + 1); return(k) }
    { for (n=1, 100, my(f=factor(n), a=1); for (i=1, matsize(f)[1], a*=Composite(primepi(f[i, 1]))^f[i, 2]); a=gcd(n, a); print1(a, ", ") ) } \\ Harry J. Smith, Feb 07 2010