login
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.
2
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, 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
OFFSET
1,2
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 does not merge with A076839 or A105736 and ends with another cycle {2,4,6,4,2}.
CROSSREFS
KEYWORD
nonn
AUTHOR
Zak Seidov, Apr 19 2005
EXTENSIONS
More terms from Ray Chandler, May 17 2024
STATUS
approved