login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A171069 G.f. -x*(x-1)*(1+x)/(1-x-12*x^2-x^3+x^4). 1

%I

%S 0,1,1,12,25,169,480,2521,8425,38988,142129,615889,2352000,9845809,

%T 38543569,158429388,628446025,2558296441,10219534560,41389108489,

%U 165953373625,670283913612,2692893971041,10860865199521,43679923392000

%N G.f. -x*(x-1)*(1+x)/(1-x-12*x^2-x^3+x^4).

%C The member k=12 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 Vincenzo Librandi, <a href="/A171069/b171069.txt">Table of n, a(n) for n = 0..1000</a>

%H 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 <a href="/index/Rec">Index entries for linear recurrences with constant coefficients</a>, signature (1,12,1,-1).

%F a(n)= +a(n-1) +12*a(n-2) +a(n-3) -a(n-4).

%t CoefficientList[Series[-x*(x - 1)*(1 + x)/(1 - x - 12*x^2 - x^3 + x^4), {x, 0, 40}], x] (* _Vincenzo Librandi_, Dec 19 2012 *)

%o (MAGMA) I:=[0, 1, 1, 12]; [n le 4 select I[n] else Self(n-1) + 12*Self(n-2) + Self(n-3) - Self(n-4): n in [1..30]]; // _Vincenzo Librandi_, Dec 19 2012

%Y Cf. A116201 (k=1), A105309 (k=2), A152090 (k=3), A007598 (k=4), A005178 (k=5), A003757 (k=6).

%K nonn,easy

%O 0,4

%A _R. J. Mathar_, at the request of _R. K. Guy_, Sep 03 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 23 05:25 EDT 2019. Contains 323508 sequences. (Running on oeis4.)