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.

A276126 a(0) = a(1) = a(2) = a(3) = a(4) = 1; for n>4, a(n) = ( a(n-1)^2+a(n-2)^2+a(n-3)^2+a(n-4)^2+a(n-1)*a(n-2)*a(n-3)*a(n-4) ) / a(n-5).

This page as a plain text file.
%I A276126 #24 Aug 08 2022 18:52:07
%S A276126 1,1,1,1,1,5,33,1281,1853441,3826997739521,2989151785658720873470945,
%T A276126 271581474754155314350055167823358355425497243141,
%U A276126 57581776430597685625970981157448022010386123824977761496513036956000541901241585948341716033
%N A276126 a(0) = a(1) = a(2) = a(3) = a(4) = 1; for n>4, a(n) = ( a(n-1)^2+a(n-2)^2+a(n-3)^2+a(n-4)^2+a(n-1)*a(n-2)*a(n-3)*a(n-4) ) / a(n-5).
%H A276126 Seiichi Manyama, <a href="/A276126/b276126.txt">Table of n, a(n) for n = 0..15</a>
%F A276126 a(n) = 10*a(n-1)*a(n-2)*a(n-3)*a(n-4) - a(n-1)*a(n-2)*a(n-3) - a(n-2)*a(n-3)*a(n-4) - a(n-3)*a(n-4)*a(n-1) - a(n-4)*a(n-1)*a(n-2) - a(n-5).
%t A276126 nxt[{a_,b_,c_,d_,e_}]:={b,c,d,e,(e^2+d^2+c^2+b^2+e*d*c*b)/a}; NestList[nxt,{1,1,1,1,1},15][[All,1]] (* _Harvey P. Dale_, Aug 08 2022 *)
%o A276126 (Ruby)
%o A276126 def A(m, n)
%o A276126   a = Array.new(m, 1)
%o A276126   ary = [1]
%o A276126   while ary.size < n + 1
%o A276126     i = a[1..-1].inject(0){|s, i| s + i * i} + a[1..-1].inject(:*)
%o A276126     break if i % a[0] > 0
%o A276126     a = *a[1..-1], i / a[0]
%o A276126     ary << a[0]
%o A276126   end
%o A276126   ary
%o A276126 end
%o A276126 def A276126(n)
%o A276126   A(5, n)
%o A276126 end
%Y A276126 Cf. A165903, A276124.
%K A276126 nonn
%O A276126 0,6
%A A276126 _Seiichi Manyama_, Aug 21 2016