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.

A247379 a(n) = gcd(EKG(n),n) with EKG = A064413.

Original entry on oeis.org

1, 2, 1, 2, 1, 3, 1, 8, 1, 5, 1, 6, 1, 7, 3, 8, 1, 2, 1, 1, 3, 1, 1, 1, 5, 2, 1, 1, 1, 6, 1, 2, 1, 17, 7, 2, 1, 19, 3, 40, 1, 2, 1, 1, 3, 2, 1, 6, 7, 1, 3, 4, 1, 1, 5, 2, 1, 29, 1, 2, 1, 31, 9, 64, 1, 2, 1, 1, 3, 2, 1, 8, 1, 1, 3, 1, 7, 1, 1, 2, 1, 1, 1, 1
Offset: 1

Views

Author

Reinhard Zumkeller, Sep 15 2014

Keywords

Comments

a(n) = gcd(A064413(n),n);
a(A247383(n)) = n and a(m) != n for m < A247383(n).

Crossrefs

Cf. A064413, A152458 (fixed points), A247383.

Programs

  • Haskell
    a247379 n = gcd n $ a064413 n