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!)
A258364 Sum over all partitions lambda of n into 9 distinct parts of Product_{i:lambda} prime(i). 2

%I #4 May 27 2015 17:34:35

%S 223092870,281291010,641200560,1103452350,2195564910,3564916950,

%T 6783216270,11130902406,20071816324,33727230365,53845325737,

%U 85802963866,137813486551,211362471237,328671594863,499826194085,762249961621,1134280917570,1705626051462,2476880995049

%N Sum over all partitions lambda of n into 9 distinct parts of Product_{i:lambda} prime(i).

%H Alois P. Heinz, <a href="/A258364/b258364.txt">Table of n, a(n) for n = 45..1000</a>

%p g:= proc(n, i) option remember; convert(series(`if`(n=0, 1,

%p `if`(i<1, 0, add(g(n-i*j, i-1)*(ithprime(i)*x)^j

%p , j=0..min(1, n/i)))), x, 10), polynom)

%p end:

%p a:= n-> coeff(g(n$2), x, 9):

%p seq(a(n), n=45..70);

%Y Column k=9 of A258323.

%Y Cf. A000040.

%K nonn

%O 45,1

%A _Alois P. Heinz_, May 27 2015

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