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!)
A115205 a(n) = binomial(n, 9) + 1. 1

%I #26 Dec 19 2022 02:17:18

%S 1,1,1,1,1,1,1,1,1,2,11,56,221,716,2003,5006,11441,24311,48621,92379,

%T 167961,293931,497421,817191,1307505,2042976,3124551,4686826,6906901,

%U 10015006,14307151,20160076,28048801,38567101,52451257,70607461,94143281,124403621

%N a(n) = binomial(n, 9) + 1.

%H G. C. Greubel, <a href="/A115205/b115205.txt">Table of n, a(n) for n = 0..10000</a>

%F G.f.: ((3*x^2-3*x+1)*(3*x^6-9*x^5+18*x^4-21*x^3+15*x^2-6*x+1))/(x-1)^10. [Maksym Voznyy (voznyy(AT)mail.ru), Jul 27 2009]

%F a(n) = (1/9!)*(n+1)*(n^8 - 37*n^7 + 583*n^6 - 5119*n^5 + 27568*n^4 - 94852*n^3 + 212976*n^2 - 322560*n + 9!) = binomial(n,9)+1. - _G. C. Greubel_, Feb 05 2016

%p seq(binomial(n,9)+1, n=0..26); # _Zerinvary Lajos_, Jan 13 2007

%t Table[1 + Binomial[n,9], {n, 0, 20}] (* _G. C. Greubel_, Feb 05 2016 *)

%o (PARI) a(n) = binomial(n, 9) + 1; \\ _Altug Alkan_, Feb 05 2016

%o (Magma) [Binomial(n, 9)+1: n in [0..50]]; // _Vincenzo Librandi_, Feb 05 2016

%Y Cf. A035927.

%K nonn,easy

%O 0,10

%A _Roger L. Bagula_, Mar 03 2006

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