cp's OEIS Frontend

A276530 a(n) = (a(n-1) * a(n-5) + a(n-3)^3) / a(n-6), a(0) = a(1) = ... = a(5) = 1.

%I A276530 #19 Apr 21 2023 17:56:34
%S A276530 1,1,1,1,1,1,2,3,4,12,39,142,1077,21209,779449,106636837,245010524697,
%T A276530 3336696488691229,1125981890791313205482,
%U A276530 693480182652378523758257457499,47660918720485535883730945247863294175948,13387114027268508450553229985503810242341235794343085252
%N A276530 a(n) = (a(n-1) * a(n-5) + a(n-3)^3) / a(n-6), a(0) = a(1) = ... = a(5) = 1.
%H A276530 Seiichi Manyama, <a href="/A276530/b276530.txt">Table of n, a(n) for n = 0..30</a>
%t A276530 RecurrenceTable[{a[n] == (a[n - 1] a[n - 5] + a[n - 3]^3)/a[n - 6], a[0] == a[1] == a[2] == a[3] == a[4] == a[5] == 1}, a, {n, 0, 21}] (* _Michael De Vlieger_, Nov 16 2016 *)
%t A276530 nxt[{a_,b_,c_,d_,e_,f_}]:={b,c,d,e,f,(f b+d^3)/a}; NestList[nxt,{1,1,1,1,1,1},25][[;;,1]] (* _Harvey P. Dale_, Apr 21 2023 *)
%o A276530 (Ruby)
%o A276530 def A(k, m, n)
%o A276530   a = Array.new(2 * k, 1)
%o A276530   ary = [1]
%o A276530   while ary.size < n + 1
%o A276530     i = a[-1] * a[1] + a[k] ** m
%o A276530     break if i % a[0] > 0
%o A276530     a = *a[1..-1], i / a[0]
%o A276530     ary << a[0]
%o A276530   end
%o A276530   ary
%o A276530 end
%o A276530 def A276530(n)
%o A276530   A(3, 3, n)
%o A276530 end
%Y A276530 Cf. A276529, A275173, A102276.
%K A276530 nonn
%O A276530 0,7
%A A276530 _Seiichi Manyama_, Nov 16 2016