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!)
A305471 a(0) = 1, a(1) = 3, a(n) = 3*n*a(n-1) - a(n-2). 3

%I #16 Jun 03 2018 03:44:43

%S 1,3,17,150,1783,26595,476927,9988872,239256001,6449923155,

%T 193258438649,6371078552262,229165569442783,8931086129716275,

%U 374876451878640767,16860509248409118240,808929567471759034753,41238547431811301654163

%N a(0) = 1, a(1) = 3, a(n) = 3*n*a(n-1) - a(n-2).

%C Let S(i,j,n) denote a sequence of the form a(0) = 1, a(1) = i, a(n) = i*n*a(n-1) + j*a(n-2). Then S(i,j,n) = Sum_{k=0..floor(n/2)} ((n-k)!/k!)*binomial(n-k,k)*i^(n-2*k)*j^k.

%H Seiichi Manyama, <a href="/A305471/b305471.txt">Table of n, a(n) for n = 0..380</a>

%F a(n) = Sum_{k=0..floor(n/2)} ((n-k)!/k!)*binomial(n-k,k)*3^(n-2*k)*(-1)^k.

%F a(n) ~ BesselJ(0, 2/3) * n! * 3^n. - _Vaclav Kotesovec_, Jun 03 2018

%o (PARI) {a(n) = sum(k=0, n/2, ((n-k)!/k!)*binomial(n-k, k)*3^(n-2*k)*(-1)^k)}

%Y Column k=3 of A305466.

%Y Cf. A305459, A305472.

%K nonn

%O 0,2

%A _Seiichi Manyama_, Jun 02 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 April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)