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.

A263044 a(1) = a(2) = a(3) = 1; for n>3, a(n) = (a(n-3) + a(n-1))*(a(n-2) + a(n-3)).

This page as a plain text file.
%I A263044 #22 Sep 08 2022 08:46:14
%S A263044 1,1,1,4,10,55,826,54340,47921995,2643710343286,126835535679488180710,
%T A263044 335322495784116748418182251685105,
%U A263044 42530809264656915340847577048392358554130713446770436
%N A263044 a(1) = a(2) = a(3) = 1; for n>3, a(n) = (a(n-3) + a(n-1))*(a(n-2) + a(n-3)).
%F A263044 a(n) = (a(n-3) + a(n-1))*(a(n-2) + a(n-3)) for n>=4; a(1)=a(2)=a(3)=1.
%t A263044 RecurrenceTable[{a[1] == a[2] == a[3] == 1, a[n] == (a[n - 3] + a[n - 1]) (a[n - 2] + a[n - 3])}, a, {n, 15}] (* _Bruno Berselli_, Oct 09 2015 *)
%o A263044 (PARI) a(n) = if(n<4, 1, (a(n-3)+a(n-1))*(a(n-2)+a(n-3)));
%o A263044 vector(15, n, a(n)) \\ _Altug Alkan_, Oct 08 2015
%o A263044 (Magma) [n le 3 select 1  else (Self(n-3)+ Self(n-1))*(Self(n-2)+Self(n-3)): n in [1..15]]; // _Vincenzo Librandi_, Oct 09 2015
%K A263044 nonn
%O A263044 1,4
%A A263044 _Gianmarco Giordano_, Oct 08 2015
%E A263044 More terms from _Altug Alkan_, Oct 08 2015