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.

This page as a plain text file.
%I A356729 #15 Sep 11 2022 00:24:37
%S A356729 118,130,133,135,137,140,148,149,153,155,161,167,169,174,175,182,183,
%T A356729 185,189,190,194,195,200,202,205,206,208,209,210,213,214,215,216,217,
%U A356729 220,221,222,223,224,225,228,229,231,234,235,236,239,240,243,244,245,247,248,249,250,251,253,254
%N A356729 Numbers having at least 4 distinct partitions into exactly 3 parts with the same product.
%C A356729 The smallest number that has at least 5 partitions is 185.
%e A356729 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.
%t A356729 Select[Range[3, 300], Max[Transpose[Tally[Apply[Times, IntegerPartitions[#, {3}], {1}]]][[2]]] >= 4 &]
%Y A356729 Cf. A119028.
%K A356729 nonn
%O A356729 1,1
%A A356729 _Tanya Khovanova_, Sep 09 2022