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!)
A326845 Sum times maximum of the integer partition with Heinz number n. 15

%I #5 Jul 29 2019 13:55:13

%S 0,1,4,2,9,6,16,3,8,12,25,8,36,20,15,4,49,10,64,15,24,30,81,10,18,42,

%T 12,24,100,18,121,5,35,56,28,12,144,72,48,18,169,28,196,35,21,90,225,

%U 12,32,21,63,48,256,14,40,28,80,110,289,21,324,132,32,6,54,40

%N Sum times maximum of the integer partition with Heinz number n.

%C The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

%F a(n) = A056239(n) * A061395(n).

%t Table[If[n==1,0,With[{y=Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]},Total[y]*Max[y]]],{n,100}]

%Y Cf. A056239, A061395, A106529, A112798, A316413, A326836, A326844, A326846.

%K nonn

%O 1,3

%A _Gus Wiseman_, Jul 26 2019

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 July 24 05:58 EDT 2024. Contains 374575 sequences. (Running on oeis4.)