cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A356729 Numbers having at least 4 distinct partitions into exactly 3 parts with the same product.

Original entry on oeis.org

118, 130, 133, 135, 137, 140, 148, 149, 153, 155, 161, 167, 169, 174, 175, 182, 183, 185, 189, 190, 194, 195, 200, 202, 205, 206, 208, 209, 210, 213, 214, 215, 216, 217, 220, 221, 222, 223, 224, 225, 228, 229, 231, 234, 235, 236, 239, 240, 243, 244, 245, 247, 248, 249, 250, 251, 253, 254
Offset: 1

Views

Author

Tanya Khovanova, Sep 09 2022

Keywords

Comments

The smallest number that has at least 5 partitions is 185.

Examples

			118 is in this sequence because it has 4 partitions (14,50,54), (15,40,63), (18,30,70), and (21,25,72) with the same product 37800.
		

Crossrefs

Cf. A119028.

Programs

  • Mathematica
    Select[Range[3, 300], Max[Transpose[Tally[Apply[Times, IntegerPartitions[#, {3}], {1}]]][[2]]] >= 4 &]