login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A304944 a(0) = 0, a(1) = 1 and a(n) = 6*a(n-1)/(n-1) + 16*a(n-2) for n > 1. 2

%I #18 Jun 08 2023 15:33:00

%S 0,1,6,34,164,790,3572,16212,71048,312678,1345220,5809980,24692600,

%T 105305980,443684360,1875046120,7848968208,32944100998,137210821092,

%U 572842556332,2376270786840,9878362137364,40842721771544,169192718317336,697620779210096

%N a(0) = 0, a(1) = 1 and a(n) = 6*a(n-1)/(n-1) + 16*a(n-2) for n > 1.

%C Let a(0) = 0, a(1) = 1 and a(n) = 2*m*a(n-1)/(n-1) + k^2*a(n-2) for n > 1, then the g.f. is x/(2*m) * d/dx ((1 + k*x)/(1 - k*x))^(m/k).

%H Seiichi Manyama, <a href="/A304944/b304944.txt">Table of n, a(n) for n = 0..1000</a>

%F a(n) = n*A304941(n)/6.

%F G.f.: x/(1-4*x)^2 * ((1-4*x)/(1+4*x))^(1/4).

%t CoefficientList[Series[x/((1-4*x)^(7/4)*(1+4*x)^(1/4)), {x,0,40}], x] (* _G. C. Greubel_, Jun 07 2023 *)

%o (Magma) [n le 2 select n-1 else 2*(3*Self(n-1) + 8*(n-2)*Self(n-2))/(n-2): n in [1..40]]; // _G. C. Greubel_, Jun 07 2023

%o (SageMath)

%o @CachedFunction

%o def a(n): # b = A304944

%o if n<2: return n

%o else: return 2*(3*a(n-1) + 8*(n-1)*a(n-2))//(n-1)

%o [a(n) for n in range(41)] # _G. C. Greubel_, Jun 07 2023

%Y Cf. A304933, A304941.

%K nonn

%O 0,3

%A _Seiichi Manyama_, May 22 2018

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 6 21:30 EDT 2024. Contains 372297 sequences. (Running on oeis4.)