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!)
A319330 Number of integer partitions of n whose length is equal to the GCD of the parts and whose sum is equal to the LCM of the parts. 1
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 3, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 2, 0, 0, 2, 0, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 1, 0, 1, 0, 3, 0, 0, 0, 0, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,48
LINKS
EXAMPLE
A list of all such partitions begins (1), (9,6,3), (20,8,8,4), (24,16,4,4), (16,16,12,4), (16,12,12,8), (25,10,5,5,5), (20,15,15,5,5), (20,15,10,10,5).
MATHEMATICA
Table[Length[Select[IntegerPartitions[n], And[LCM@@#==Total[#], GCD@@#==Length[#]]&]], {n, 30}]
CROSSREFS
Sequence in context: A009138 A175562 A373202 * A291204 A331414 A111025
KEYWORD
nonn
AUTHOR
Gus Wiseman, Sep 17 2018
EXTENSIONS
a(71)-a(105) from Alois P. Heinz, Sep 18 2018
STATUS
approved

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 August 7 09:49 EDT 2024. Contains 375011 sequences. (Running on oeis4.)