login
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)=3.
11

%I #11 May 17 2024 15:30:21

%S 1,3,4,4,3,1,2,3,2,1,1,2,3,2,1,1,2,3,2,1,1,2,3,2,1,1,2,3,2,1,1,2,3,2,

%T 1,1,2,3,2,1,1,2,3,2,1,1,2,3,2,1,1,2,3,2,1,1,2,3,2,1,1,2,3,2,1,1,2,3,

%U 2,1,1,2,3,2,1,1,2,3,2,1,1,2,3,2,1,1,2,3,2,1,1,2,3,2,1,1,2,3,2,1,1,2

%N 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)=3.

%C 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 A076839, starting with 6th term = 1.

%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,1).

%Y Cf. A076839, A105737 - A105746.

%K nonn

%O 1,2

%A _Zak Seidov_, Apr 19 2005

%E More terms from _Ray Chandler_, May 17 2024