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!)
A281581 a(n) = (15*2^(2*n+2) + 15*2^(n+2) + 5*2^(n+3)*3^(n+1) - 24*5^(n+1))/120. 2

%I #41 Mar 19 2017 19:30:55

%S 1,4,21,127,807,5179,33111,210067,1321887,8255899,51225351,316067107,

%T 1941032367,11873549419,72394874391,440204293747,2670669533247,

%U 16172309991739,97779619272231,590423692897987,3561340764760527,21462312506478859

%N a(n) = (15*2^(2*n+2) + 15*2^(n+2) + 5*2^(n+3)*3^(n+1) - 24*5^(n+1))/120.

%H Seiichi Manyama, <a href="/A281581/b281581.txt">Table of n, a(n) for n = 0..1285</a>

%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (17,-104,268,-240).

%F G.f.: ( 1-13*x+57*x^2-82*x^3 ) / ( (6*x-1)*(4*x-1)*(2*x-1)*(5*x-1) ). - _R. J. Mathar_, Mar 19 2017

%F a(n) = 6^n +2^(n-1)-5^n+4^n/2 . - _R. J. Mathar_, Mar 19 2017

%t Table[(15*2^(2*n+2) + 15*2^(n+2) + 5*2^(n+3)*3^(n+1) - 24*5^(n+1)) / 120, {n, 0, 21] (* _Indranil Ghosh_, Mar 05 2017 *)

%o (PARI)

%o a(n) = (15*2^(2*n+2) + 15*2^(n+2) + 5*2^(n+3)*3^(n+1) - 24*5^(n+1)) / 120;

%o for (n=0, 21, print1(a(n),", ")); \\ _Indranil Ghosh_, Mar 05 2017

%o (Python) def A281581(n): return (15*2**(2*n+2) + 15*2**(n+2) + 5*2**(n+3)*3**(n+1) - 24*5**(n+1)) / 120 # _Indranil Ghosh_, Mar 05 2017

%o (Ruby)

%o def A281581(n)

%o (0..n).map{|i| (15 * 2 ** (2 * i + 2) + 15 * 2 ** (i + 2) + 5 * 2 ** (i + 3) * 3 ** (i + 1) - 24 * 5 ** (i + 1)) / 120}

%o end

%Y Row n=5 of A283272.

%K nonn,easy

%O 0,2

%A _Seiichi Manyama_, Mar 05 2017

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 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)