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.

A115043 a(0)=3, a(1)=5. a(n) = a(n-1)*a(n-2) if n odd, else a(n) = a(n-1)/a(n-2).

This page as a plain text file.
%I A115043 #4 Mar 30 2012 18:40:02
%S A115043 3,5,15,3,45,15,675,45,30375,675,20503125,30375,622782421875,20503125,
%T A115043 12768985843505859375,622782421875,7952299928506168842315673828125,
%U A115043 12768985843505859375
%N A115043 a(0)=3, a(1)=5. a(n) = a(n-1)*a(n-2) if n odd, else a(n) = a(n-1)/a(n-2).
%C A115043 All divisors >1 of the terms are also in the sequence.
%F A115043 a(n) = a(n-2)*a(n-4) if n odd. a(n)=a(n-3) if n even.
%F A115043 a(2n+1) = 3^Fibonacci(n+1) * 5^Fibonacci(n).
%F A115043 a(2n) = 3^Fibonacci(n-1) * 5^Fibonacci(n-2).
%Y A115043 Cf. A115033, A115034, A174348.
%K A115043 easy,nonn
%O A115043 0,1
%A A115043 _Giovanni Teofilatto_, Feb 28 2006
%E A115043 Formulas corrected by _R. J. Mathar_, Mar 16 2010