|
| |
|
|
A115034
|
|
Alternately multiply and divide, with a(0)=1 and a(1)=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; 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.
|
|
|
CROSSREFS
| Sequence in context: A038541 A070215 A071457 * A027869 A156748 A075445
Adjacent sequences: A115031 A115032 A115033 * A115035 A115036 A115037
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Feb 26 2006; corrected Feb 28 2006
|
| |
|
|
