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.

A105738 For n>2, a(n) > 0 is such that a(n-1)^2+4*a(n-2)*a(n) is a minimal square, a(1)=1,a(2)=5.

Original entry on oeis.org

1, 5, 6, 8, 8, 6, 2, 4, 6, 4, 2, 2, 4, 6, 4, 2, 2, 4, 6, 4, 2, 2, 4, 6, 4, 2, 2, 4, 6, 4, 2, 2, 4, 6, 4, 2, 2, 4, 6, 4, 2, 2, 4, 6, 4, 2, 2, 4, 6, 4, 2, 2, 4, 6, 4, 2, 2, 4, 6, 4, 2, 2, 4, 6, 4, 2, 2, 4, 6, 4, 2, 2, 4, 6, 4, 2, 2, 4, 6, 4, 2, 2, 4, 6, 4, 2, 2, 4, 6, 4, 2, 2, 4, 6, 4, 2, 2, 4, 6, 4, 2, 2
Offset: 1

Views

Author

Zak Seidov, Apr 19 2005

Keywords

Comments

The sequence depends on seed terms a(1) and a(2); if a(1)=1, a(3)=a(2)+1. All(?) sequences end with cycle={1,2,3,2,1} (or {2,4,6,4,2}, which essentially the same cycle) of length = 5. This particular sequence merges with A105737, starting with 2nd term = 5.

Crossrefs

Extensions

More terms from Ray Chandler, May 17 2024