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.

Showing 1-1 of 1 results.

A200581 a(n) = gcd(t(n), t(2*n)), where t = A200218.

Original entry on oeis.org

297, 4456485, 552604437, 8291281429233, 1028119449829329, 15425912516520681549, 1912814180168014341405, 28699879385153403699122169, 3558786956573202226705490361, 53396068196303711362892876498613, 6621116015128616782200943391318373
Offset: 1

Views

Author

Artur Jasinski, Nov 19 2011

Keywords

Comments

Successive records in GCD of A200218 occurred between A200218(n) and A200218(2*n). Also, A200582 shows big increases in GCD for A200218(n) and A200218(2*n-1).

Crossrefs

Cf. A200218, A200582.
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.