A115034 - 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

A115034

Alternately multiply and divide, with a(1)=1 and a(2)=2.

1, 2, 2, 1, 2, 2, 4, 2, 8, 4, 32, 8, 256, 32, 8192, 256, 2097152, 8192, 17179869184, 2097152, 36028797018963968, 17179869184, 618970019642690137449562112, 36028797018963968

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

OFFSET

1,2

COMMENTS

a(n) = power of 2; taking the terms a(n+1)>=a(n), the sequence of exponent of power of 2 is 0,1,1,2,3,5,8,... which are the Fibonacci Numbers.

LINKS

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

FORMULA

a(2*k) = a(2*k-3); a(2*k+1) = a(2*k)*a(2*k-1) - Georg Fischer, Jun 18 2021

MATHEMATICA

nxt[{a_, b_}]:={a*b, (a*b)/b}; NestList[nxt, {1, 2}, 10]//Flatten (* Georg Fischer, Jun 18 2021 *)

CROSSREFS