|
Search: id:A076839
|
|
|
| A076839 |
|
a(1) = a(2) = 1; a(n) = (a(n-1)+1)/a(n-2) (for n>2). |
|
+0
5
|
|
| 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, 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, 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, 2, 1, 1, 2, 3, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Any sequence a(1),a(2),a(3),... defined by the recurrence a(n) = (a(n-1)+1)/a(n-2) (for n>2) has period 5. The theory of cluster algebras currently being developed by Fomin and Zelevinsky gives a context for these facts, but it doesn't really explain them in an elementary way. - James Propp, Nov 20, 2002
Terms of the simple continued fraction of 34/[sqrt(2405)-29]. Decimal expansion of 1248/11111. [From Paolo P. Lava (ppl(AT)spl.at), Aug 05 2009]
|
|
LINKS
|
Sergey Fomin and Andrei Zelevinsky, Cluster algebras II: Finite type classification
|
|
FORMULA
|
a(n)=1/50*{19*(n mod 5)+19*[(n+1) mod 5]-[(n+2) mod 5]-[(n+3) mod 5]+9*[(n+4) mod 5]} - Paolo P. Lava (ppl(AT)spl.at), Nov 27 2006
|
|
MAPLE
|
a := 1; b := 1; f := proc(n) option remember; global a, b; if n=1 then a elif n=2 then b else (f(n-1)+1)/f(n-2); fi; end;
|
|
CROSSREFS
|
Cf. A076840, A076841, A076844, A076823.
Sequence in context: A083279 A159455 A105734 this_sequence A092542 A026552 A086437
Adjacent sequences: A076836 A076837 A076838 this_sequence A076840 A076841 A076842
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Nov 21 2002
|
|
|
Search completed in 0.010 seconds
|
