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

A122961
Alternately form product and sum of all previous terms.
2
1, 1, 1, 3, 3, 9, 81, 99, 649539, 649737, 274124633198656977, 274124633199956451, 20598907656583661830059012023854018733151994905840579, 20598907656583661830059012023854019281401261305753481
OFFSET
1,4
COMMENTS
Note that definition does not make a(1) a special case; it is the empty product, which is 1. If we started with addition, the sequence would be all zeros.
FORMULA
a(1) = a(2) = 1. For n > 1, a(2n-1) = a(2n-3)^2 * a(2n-2), a(2n) = 2 * a(2n-2) + a(2n-1).
PROG
(PARI) first(n) = my(res = vector(n, i, 1)); for(x=4, n, res[x]=if(x%2, prod(i=1, x-1, res[i]), sum(i=1, x-1, res[i]))); res \\ Iain Fox, Oct 29 2018
(PARI) first(n) = my(res = vector(n, i, 1)); for(x=4, n, res[x]=if(x%2, res[x-1]*res[x-2]^2, res[x-1]+2*res[x-2])); res \\ Iain Fox, Oct 29 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved