login

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”).

A076824
Let a(1)=a(2)=1, a(n)=(2^ceiling(a(n-1)/2)+1)/a(n-2).
1
1, 1, 3, 5, 3, 1, 1, 3, 5, 3, 1, 1, 3, 5, 3, 1, 1, 3, 5, 3, 1, 1, 3, 5, 3, 1, 1, 3, 5, 3, 1, 1, 3, 5, 3, 1, 1, 3, 5, 3, 1, 1, 3, 5, 3, 1, 1, 3, 5, 3, 1, 1, 3, 5, 3, 1, 1, 3, 5, 3, 1, 1, 3, 5, 3, 1, 1, 3, 5, 3, 1, 1, 3, 5, 3, 1, 1, 3, 5, 3, 1, 1, 3, 5, 3, 1, 1, 3, 5, 3, 1, 1, 3, 5, 3, 1, 1, 3, 5, 3, 1, 1, 3, 5, 3
OFFSET
1,3
FORMULA
5-periodic with period (1, 1, 3, 5, 3)
MATHEMATICA
LinearRecurrence[{0, 0, 0, 0, 1}, {1, 1, 3, 5, 3}, 105] (* Ray Chandler, Aug 25 2015 *)
CROSSREFS
Cf. A076839.
Sequence in context: A114865 A096196 A351179 * A103728 A243533 A239730
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Nov 24 2002
STATUS
approved