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!)
A331418 If A331417(n) is the maximum sum of primes of the parts of an integer partition of n, then a(n) = A331417(n) - n + 1. 7

%I #9 Jan 17 2020 17:42:05

%S 1,2,3,4,5,7,8,11,12,15,20,21,26,29,30,33,38,43,44,49,52,53,58,61,66,

%T 73,76,77,80,81,84,97,100,105,106,115,116,121,126,129,134,139,140,149,

%U 150,153,154,165,176,179,180,183,188,189,198,203,208,213,214,219

%N If A331417(n) is the maximum sum of primes of the parts of an integer partition of n, then a(n) = A331417(n) - n + 1.

%C For n > 4, a(n) = A014692(n).

%F a(n) = A331417(n) - n + 1.

%t Table[Max@@Table[Total[Prime/@y],{y,IntegerPartitions[n]}]-n+1,{n,0,30}]

%Y Converges to A014692.

%Y Row lengths of A331385.

%Y Sum of prime factors is A001414.

%Y Partitions into primes are A000607.

%Y Partitions whose sum of primes is divisible by their sum are A331379.

%Y Cf. A000040, A014689, A056239, A330950, A330953, A330954, A331378, A331381, A331383, A331387, A331415, A331416.

%K nonn

%O 0,2

%A _Gus Wiseman_, Jan 17 2020

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