The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A318237 E.g.f. satisfies y'' + y' + x^3*y = 0 with y(0)=1, y'(0)=0. 4

%I

%S 1,0,0,0,0,-6,6,-6,6,-6,2022,-5046,9366,-15306,23226,-3492978,

%T 14513442,-40082622,91510782,-186272862,17287893150,-101669044938,

%U 375834179418,-1106090219778,2827251464658,-186528404076558,1421197285803630,-6607708961772030,23862716390308830,-73480979595056730

%N E.g.f. satisfies y'' + y' + x^3*y = 0 with y(0)=1, y'(0)=0.

%H Robert Israel, <a href="/A318237/b318237.txt">Table of n, a(n) for n = 0..691</a>

%F (n+3)*(n+2)*(n+1)*a(n) + a(n+4) + a(n+5) = 0.

%p f:= gfun:-rectoproc({(n+3)*(n+2)*(n+1)*a(n)+a(n+4)+a(n+5)=0, a(0) = 1, a(1) = 0, a(2) = 0, a(3) = 0, a(4) = 0},a(n),remember):

%p map(f,[\$0..20]);

%t RecurrenceTable[{a[n] == -a[n-1] - (n-2)*(n-3)*(n-4)*a[n-5], a[0]==1, a[1]==0, a[2]==0, a[3]==0, a[4]==0}, a, {n,0,30}] (* _G. C. Greubel_, Aug 24 2018 *)

%o (PARI) m=30; v=concat([0,0,0,0,-6], vector(m-5)); for(n=6, m, v[n]= -v[n-1] - (n-2)*(n-3)*(n-4)*v[n-5]); concat([1], v) \\ _G. C. Greubel_, Aug 24 2018

%o (MAGMA) I:=[0,0,0,0,-6]; [1] cat [n le 5 select I[n] else -Self(n-1) - (n-2)*(n- 3)*(n-4)*Self(n-5): n in [1..30]]; // _G. C. Greubel_, Aug 24 2018

%K sign

%O 0,6

%A _Robert Israel_, Aug 21 2018

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.

Last modified November 28 10:05 EST 2021. Contains 349401 sequences. (Running on oeis4.)