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!)
A320695 Number of partitions of n with up to eight distinct kinds of 1. 2

%I #10 Apr 24 2021 20:44:30

%S 1,8,29,65,108,158,230,338,488,688,953,1303,1761,2354,3118,4097,5340,

%T 6910,8888,11365,14448,18273,23004,28832,35981,44719,55374,68333,

%U 84037,103010,125885,153399,186407,225915,273099,329331,396212,475603,569671,680926

%N Number of partitions of n with up to eight distinct kinds of 1.

%H Alois P. Heinz, <a href="/A320695/b320695.txt">Table of n, a(n) for n = 0..10000</a>

%F a(n) ~ Pi * 2^(11/2) * exp(Pi*sqrt(2*n/3)) / (3 * n^(3/2)). - _Vaclav Kotesovec_, Oct 24 2018

%F G.f.: (1 + x)^8 * Product_{k>=2} 1 / (1 - x^k). - _Ilya Gutkovskiy_, Apr 24 2021

%p b:= proc(n, i) option remember; `if`(n=0 or i=1,

%p binomial(8, n), `if`(i>n, 0, b(n-i, i))+b(n, i-1))

%p end:

%p a:= n-> b(n$2):

%p seq(a(n), n=0..60);

%Y Column k=8 of A292622.

%K nonn

%O 0,2

%A _Alois P. Heinz_, Oct 19 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 25 08:27 EDT 2024. Contains 371964 sequences. (Running on oeis4.)