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.

A105737 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)=4.

This page as a plain text file.
%I A105737 #11 May 17 2024 15:32:54
%S A105737 1,4,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,
%T A105737 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,
%U A105737 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
%N A105737 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)=4.
%C A105737 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 does not merge with A076839 or A105736 and ends with another cycle {2,4,6,4,2}.
%H A105737 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,1).
%Y A105737 Cf. A076839, A105736 - A105746.
%K A105737 nonn
%O A105737 1,2
%A A105737 _Zak Seidov_, Apr 19 2005
%E A105737 More terms from _Ray Chandler_, May 17 2024