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

%I #4 May 27 2015 17:27:07

%S 30030,39270,90300,177930,381222,722434,1477619,2309879,4194446,

%T 6846481,11667593,18212397,30309561,45149226,70722044,105790662,

%U 160115543,232478684,346845682,489561123,709058342,994019962,1405076982,1932862089,2705315737,3653574123

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

%H Alois P. Heinz, <a href="/A258361/b258361.txt">Table of n, a(n) for n = 21..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, 7), polynom)

%p end:

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

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

%Y Column k=6 of A258323.

%Y Cf. A000040.

%K nonn

%O 21,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 March 28 07:33 EDT 2024. Contains 371235 sequences. (Running on oeis4.)