|
Search: id:A105736
|
|
|
| A105736 |
|
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. |
|
+0
3
|
|
| 1, 3, 4, 4, 3, 1, 2, 3, 2, 1, 1, 2, 3, 2, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
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. This particular sequence merges with A105734, starting with 6th term = 1.
|
|
CROSSREFS
|
Cf. A105734 - A105746.
Sequence in context: A081573 A106290 A073498 this_sequence A090283 A117499 A019917
Adjacent sequences: A105733 A105734 A105735 this_sequence A105737 A105738 A105739
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Zak Seidov (zakseidov(AT)yahoo.com), Apr 19 2005
|
|
|
Search completed in 0.002 seconds
|
