A076841 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A076841

a(1) = a(2) = 1; a(n) = (a(n-1)+1)/a(n-2) (for n>2, n odd), (a(n-1)^3+1)/a(n-2) (for n>2, n even).

1, 1, 2, 9, 5, 14, 3, 2, 1, 1, 2, 9, 5, 14, 3, 2, 1, 1, 2, 9, 5, 14, 3, 2, 1, 1, 2, 9, 5, 14, 3, 2, 1, 1, 2, 9, 5, 14, 3, 2, 1, 1, 2, 9, 5, 14, 3, 2, 1, 1, 2, 9, 5, 14, 3, 2, 1, 1, 2, 9, 5, 14, 3, 2, 1, 1, 2, 9, 5, 14, 3, 2, 1, 1, 2, 9, 5, 14, 3, 2, 1, 1, 2, 9, 5, 14, 3, 2, 1, 1, 2, 9, 5, 14, 3, 2, 1, 1, 2

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

COMMENTS

Any sequence a(1),a(2),a(3),... defined by the recurrence a(n) = (a(n-1)+1)/a(n-2) (for n>2, n odd), (a(n-1)^3+1)/a(n-2) (for n>2, n even) has period 8. 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

LINKS

Table of n, a(n) for n=1..99.

Sergey Fomin and Andrei Zelevinsky, Cluster algebras II: Finite type classification

Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 0, 0, 0, 0, 1).

MAPLE

a := 1; b := 1; f := proc(n) option remember; global a, b; if n=1 then RETURN(a); fi; if n=2 then RETURN(b); fi; if n mod 2 = 1 then RETURN((f(n-1)+1)/f(n-2)); fi; RETURN((f(n-1)^3+1)/f(n-2)); end;

MATHEMATICA

LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 1}, {1, 1, 2, 9, 5, 14, 3, 2}, 99] (* Ray Chandler, Aug 25 2015 *)

CROSSREFS

Cf. A076839, A076840, A076844.

Sequence in context: A171052 A021342 A069857 * A213819 A361013 A193088

Adjacent sequences: A076838 A076839 A076840 * A076842 A076843 A076844

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Nov 21 2002

STATUS

approved