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!)
A172978 a(n) = binomial(n+10, 10)*4^n. 1

%I #15 Mar 27 2022 03:51:24

%S 1,44,1056,18304,256256,3075072,32800768,318636032,2867724288,

%T 24216338432,193730707456,1479398129664,10848919617536,76776969601024,

%U 526470648692736,3509804324618240,22813728110018560,144934272698941440,901813252348968960,5505807224867389440

%N a(n) = binomial(n+10, 10)*4^n.

%H Vincenzo Librandi, <a href="/A172978/b172978.txt">Table of n, a(n) for n = 0..157</a>

%H <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (44,-880,10560,-84480,473088,-1892352,5406720,-10813440,14417920,-11534336,4194304).

%F From _Amiram Eldar_, Mar 27 2022: (Start)

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

%F Sum_{n>=0} 1/a(n) = 14269429/63 - 787320*log(4/3).

%F Sum_{n>=0} (-1)^n/a(n) = 78125000*log(5/4) - 1098284605/63. (End)

%t Table[Binomial[n + 10, 10]*4^n, {n, 0, 20}]

%o (Magma) [Binomial(n+10, 10)*4^n: n in [0..30]]; // _Vincenzo Librandi_, Jun 06 2011

%Y Cf. A002697, A038845, A038846, A040075, A045543, A054337, A054338, A054339, A054340

%K nonn,easy

%O 0,2

%A _Zerinvary Lajos_, Feb 06 2010

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