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!)
A326849 Number of integer partitions of n whose length times maximum is a multiple of n. 16

%I #16 Feb 14 2021 02:19:30

%S 1,1,2,2,3,2,6,2,5,5,10,2,19,2,18,26,24,2,55,2,87,82,60,2,207,86,106,

%T 192,363,2,668,2,527,616,304,928,1827,2,498,1518,3229,2,4294,2,4445,

%U 6307,1266,2,11560,3629,8280,7802,13633,2,19120,18938,31385,16618,4584

%N Number of integer partitions of n whose length times maximum is a multiple of n.

%C The Heinz numbers of these partitions are given by A326848.

%H Fausto A. C. Cariboni, <a href="/A326849/b326849.txt">Table of n, a(n) for n = 0..160</a>

%e The a(1) = 1 through a(9) = 5 partitions:

%e 1 2 3 4 5 6 7 8 9

%e 11 111 22 11111 33 1111111 44 333

%e 1111 222 2222 621

%e 411 4211 321111

%e 3111 11111111 111111111

%e 111111

%e For example, (4,1,1) is such a partition because its length times maximum is 3 * 4 = 12, which is a multiple of 6.

%t Table[If[n==0,1,Length[Select[IntegerPartitions[n],Divisible[Max[#]*Length[#],n]&]]],{n,0,30}]

%Y Cf. A018818, A047993, A067538, A326837, A326842, A326843.

%K nonn

%O 0,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 April 16 04:38 EDT 2024. Contains 371696 sequences. (Running on oeis4.)