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!)
A305032 a(0) = 0, a(1) = 1 and a(n) = 6*a(n-1)/(n-1) + 4*a(n-2) for n > 1. 2

%I #15 Jun 07 2023 20:06:05

%S 0,1,6,22,68,190,500,1260,3080,7350,17220,39732,90552,204204,456456,

%T 1012440,2230800,4886310,10647780,23094500,49884120,107343236,

%U 230205976,492156392,1049212528,2230928700,4732273000,10015777800,21154820400,44596287000,93846099600

%N a(0) = 0, a(1) = 1 and a(n) = 6*a(n-1)/(n-1) + 4*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="/A305032/b305032.txt">Table of n, a(n) for n = 0..3000</a>

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

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

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

%o (Magma) [n le 2 select n-1 else 2*(3*Self(n-1) + 2*(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 = A305032

%o if n<2: return n

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

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

%Y Cf. A100071, A304944, A305031.

%K nonn

%O 0,3

%A _Seiichi Manyama_, May 24 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 August 26 20:18 EDT 2024. Contains 375462 sequences. (Running on oeis4.)