cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A115033 #17 May 31 2025 22:49:01
%S A115033 2,3,6,2,12,6,72,12,864,72,62208,864,53747712,62208,3343537668096,
%T A115033 53747712,179707499645975396352,3343537668096,
%U A115033 600858794305667322270155425185792,179707499645975396352,107978831564966913814384922944738457859243070439030784,600858794305667322270155425185792
%N A115033 Alternately multiply and divide, with a(1)=2 and a(2)=3.
%F A115033 a(2*k) = a(2*k-3); a(2*k+1) = a(2*k)*a(2*k-1). - _Georg Fischer_, Jun 18 2021
%p A115033 addmul:=proc(k,m,maxn) local f:
%p A115033   f:= proc(n) if n::even
%p A115033     then k^combinat:-fibonacci(n/2-1)  *m^combinat:-fibonacci(n/2-2)
%p A115033     else k^combinat:-fibonacci((n+1)/2)*m^combinat:-fibonacci((n-1)/2)
%p A115033     fi
%p A115033   end proc:
%p A115033   map(f, [$1..maxn]);
%p A115033 end proc: # after _Robert Israel_ in A174348
%p A115033 addmul(2,3,22)[]; # _Georg Fischer_, Jun 18 2021
%t A115033 nxt[{a_, b_}]:={a*b, (a*b)/b}; NestList[nxt, {2,3}, 10]//Flatten (* _Georg Fischer_, Jun 18 2021 *)
%Y A115033 Cf. A115034, A174348.
%K A115033 easy,nonn
%O A115033 1,1
%A A115033 _Giovanni Teofilatto_, Feb 26 2006
%E A115033 Definition adapted to offset by _Georg Fischer_, Jun 18 2021
%E A115033 Corrected and extended by _Michel Marcus_, May 31 2025