login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 1

%I #3 Mar 30 2012 17:26:14

%S 1,4,5,6,8,8,6,2,4,6,4,2,2,4,6,4,2,2,4,6,4,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)=4.

%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 does not merge with A105734 - A105736 and ends with another cycle {2,4,6,4,2}.

%Y Cf. A105734 - A105746.

%K nonn

%O 1,2

%A _Zak Seidov_, Apr 19 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)