|
Search: id:A105734
|
|
|
| A105734 |
|
For n>2, a(n) > 0 is such that a(n-1)^2+4*a(n-2)*a(n) is a minimal square, with a(1)=1, a(2)=1. |
|
+0
13
|
|
| 1, 1, 2, 3, 2, 1, 1, 2, 3, 2, 1, 1, 2, 3, 2, 1, 1, 2, 3, 2, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
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.
|
|
CROSSREFS
|
Cf. A105736 - A105746.
Adjacent sequences: A105731 A105732 A105733 this_sequence A105735 A105736 A105737
Sequence in context: A129385 A096626 A083279 this_sequence A076839 A092542 A026552
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Zak Seidov (zakseidov(AT)yahoo.com), Apr 18 2005
|
|
|
Search completed in 0.002 seconds
|
