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.

A171067 G.f. -x*(x-1)*(1+x)/((x^2+3*x+1)*(x^2-4*x+1)).

This page as a plain text file.
%I A171067 #15 Sep 08 2022 08:45:49
%S A171067 0,1,1,10,21,121,340,1561,5061,20890,72721,285121,1028160,3931201,
%T A171067 14425201,54480250,201635301,756931801,2813339860,10529812921,
%U A171067 39218508021,146573045290,546474598561,2040893746561,7612994269440
%N A171067 G.f. -x*(x-1)*(1+x)/((x^2+3*x+1)*(x^2-4*x+1)).
%C A171067 The member k=10 of a family of sequences starting 0,1,1,k with recurrence a(n) = a(n-1)+k*a(n-2)+a(n-3)-a(n-4).
%H A171067 Vincenzo Librandi, <a href="/A171067/b171067.txt">Table of n, a(n) for n = 0..1000</a>
%H A171067 Hugh Williams, R. K. Guy, <a href="http://dx.doi.org/10.1142/S1793042111004587">Some fourth-order linear divisibility sequences</a>, Intl. J. Number Theory vol. 7 (5) (2011) 1255-1277
%H A171067 <a href="/index/Rec">Index entries for linear recurrences with constant coefficients</a>, signature (1,10,1,-1).
%F A171067 a(n)= +a(n-1) +10*a(n-2) +a(n-3) -a(n-4).
%F A171067 a(n)= -(-1)^n*A005248(n)/7 + 2*A001075(n)/7.
%t A171067 CoefficientList[Series[-x*(x - 1)*(1 + x)/((x^2 + 3*x + 1)*(x^2 - 4*x + 1)), {x, 0, 40}], x] (* _Vincenzo Librandi_, Dec 19 2012 *)
%t A171067 LinearRecurrence[{1,10,1,-1},{0,1,1,10},30] (* _Harvey P. Dale_, Dec 24 2017 *)
%o A171067 (Magma) I:=[0, 1, 1, 10]; [n le 4 select I[n] else Self(n-1) + 10*Self(n-2) + Self(n-3) - Self(n-4): n in [1..30]]; // _Vincenzo Librandi_, Dec 19 2012
%Y A171067 Cf. A116201 (k=1), A105309 (k=2), A152090 (k=3), A007598 (k=4), A005178 (k=5), A003757 (k=6).
%K A171067 nonn,easy
%O A171067 0,4
%A A171067 R. J. Mathar, at the request of _R. K. Guy_, Sep 03 2010