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.
%I A276529 #35 Oct 17 2021 13:30:34 %S A276529 1,1,1,1,1,1,2,3,4,5,6,13,20,27,34,41,89,137,185,233,281,610,939,1268, %T A276529 1597,1926,4181,6436,8691,10946,13201,28657,44113,59569,75025,90481, %U A276529 196418,302355,408292,514229,620166,1346269,2072372,2798475,3524578,4250681,9227465 %N A276529 a(n) = (a(n-1) * a(n-5) + 1) / a(n-6), a(0) = a(1) = ... = a(5) = 1. %C A276529 Thanks to the linear recurrence signature, we see that this is actually five separate linear recurrence sequences, each with signature (7,-1), interwoven together. - _Greg Dresden_, Oct 16 2021 %H A276529 Seiichi Manyama, <a href="/A276529/b276529.txt">Table of n, a(n) for n = 0..5985</a> %H A276529 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,7,0,0,0,0,-1). %F A276529 a(n) + a(n+10) = 7*a(n+5). %F A276529 a(5-n) = a(n). %F A276529 G.f.: (1 +x +x^2 +x^3 +x^4 -6*x^5 -5*x^6 -4*x^7 -3*x^8 -2*x^9) / (1 -7*x^5 +x^10). - _Colin Barker_, Nov 16 2016 %F A276529 From _Greg Dresden_, Oct 16 2021: (Start) %F A276529 a(5*n) = L(4*n-2)/3 = A049685(n-1), %F A276529 a(5*n+1) = F(4*n-1) = A033891(n-1), %F A276529 a(5*n+2) = L(4*n+2)/3 - F(4*n), %F A276529 a(5*n+3) = L(4*n-2)/3 + F(4*n), %F A276529 a(5*n+4) = F(4*n+1) = A033889(n). (End) %t A276529 LinearRecurrence[{0,0,0,0,7,0,0,0,0,-1}, {1,1,1,1,1,1,2,3,4,5}, 50] (* _G. C. Greubel_, Nov 18 2016 *) %t A276529 RecurrenceTable[{a[0]==a[1]==a[2]==a[3]==a[4]==a[5]==1,a[n]==(a[n-1]a[n-5]+ 1)/a[n-6]},a,{n,50}] (* _Harvey P. Dale_, Oct 08 2020 *) %t A276529 Flatten[Table[{LucasL[4 n - 2]/3, Fibonacci[4 n - 1], LucasL[4 n + 2]/3 - Fibonacci[4 n], LucasL[4 n - 2]/3 + Fibonacci[4 n], Fibonacci[4 n + 1]}, {n, 0, 10}]] (* _Greg Dresden_, Oct 16 2021 *) %o A276529 (Ruby) %o A276529 def A(k, m, n) %o A276529 a = Array.new(2 * k, 1) %o A276529 ary = [1] %o A276529 while ary.size < n + 1 %o A276529 i = a[-1] * a[1] + a[k] ** m %o A276529 break if i % a[0] > 0 %o A276529 a = *a[1..-1], i / a[0] %o A276529 ary << a[0] %o A276529 end %o A276529 ary %o A276529 end %o A276529 def A276529(n) %o A276529 A(3, 0, n) %o A276529 end %o A276529 (PARI) Vec((1 +x +x^2 +x^3 +x^4 -6*x^5 -5*x^6 -4*x^7 -3*x^8 -2*x^9)/(1 -7*x^5 +x^10) + O(x^50)) \\ _Colin Barker_, Nov 16 2016 %Y A276529 Cf. A275173, A102276, A276530. %Y A276529 5th-sections: A049685, A033891, A033889. %K A276529 nonn,easy %O A276529 0,7 %A A276529 _Seiichi Manyama_, Nov 16 2016