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.

A349158 Heinz numbers of integer partitions with exactly one odd part.

This page as a plain text file.
%I A349158 #8 Dec 04 2021 12:38:02
%S A349158 2,5,6,11,14,15,17,18,23,26,31,33,35,38,41,42,45,47,51,54,58,59,65,67,
%T A349158 69,73,74,77,78,83,86,93,95,97,98,99,103,105,106,109,114,119,122,123,
%U A349158 126,127,135,137,141,142,143,145,149,153,157,158,161,162,167,174
%N A349158 Heinz numbers of integer partitions with exactly one odd part.
%C A349158 The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), so these are numbers with exactly one odd prime index. These are also partitions whose conjugate partition has alternating sum equal to 1.
%C A349158 Numbers that are product of a term of A031368 and a term of A066207. - _Antti Karttunen_, Nov 13 2021
%e A349158 The terms and corresponding partitions begin:
%e A349158       2: (1)         42: (4,2,1)       86: (14,1)
%e A349158       5: (3)         45: (3,2,2)       93: (11,2)
%e A349158       6: (2,1)       47: (15)          95: (8,3)
%e A349158      11: (5)         51: (7,2)         97: (25)
%e A349158      14: (4,1)       54: (2,2,2,1)     98: (4,4,1)
%e A349158      15: (3,2)       58: (10,1)        99: (5,2,2)
%e A349158      17: (7)         59: (17)         103: (27)
%e A349158      18: (2,2,1)     65: (6,3)        105: (4,3,2)
%e A349158      23: (9)         67: (19)         106: (16,1)
%e A349158      26: (6,1)       69: (9,2)        109: (29)
%e A349158      31: (11)        73: (21)         114: (8,2,1)
%e A349158      33: (5,2)       74: (12,1)       119: (7,4)
%e A349158      35: (4,3)       77: (5,4)        122: (18,1)
%e A349158      38: (8,1)       78: (6,2,1)      123: (13,2)
%e A349158      41: (13)        83: (23)         126: (4,2,2,1)
%t A349158 primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
%t A349158 Select[Range[100],Count[primeMS[#],_?OddQ]==1&]
%Y A349158 These partitions are counted by A000070 up to 0's.
%Y A349158 Allowing no odd parts gives A066207, counted by A000041 up to 0's.
%Y A349158 Requiring all odd parts gives A066208, counted by A000009.
%Y A349158 These are the positions of 1's in A257991.
%Y A349158 The even prime indices are counted by A257992.
%Y A349158 The conjugate partitions are ranked by A345958.
%Y A349158 Allowing at most one odd part gives A349150, counted by A100824.
%Y A349158 A047993 ranks balanced partitions, counted by A106529.
%Y A349158 A056239 adds up prime indices, row sums of A112798.
%Y A349158 A122111 is a representation of partition conjugation.
%Y A349158 A316524 gives the alternating sum of prime indices (reverse: A344616).
%Y A349158 A325698 ranks partitions with as many even as odd parts, counted by A045931.
%Y A349158 A340604 ranks partitions of odd positive rank, counted by A101707.
%Y A349158 A340932 ranks partitions whose least part is odd, counted by A026804.
%Y A349158 A349157 ranks partitions with as many even parts as odd conjugate parts.
%Y A349158 Cf. A000700, A001222, A027187, A027193, A028260, A031368 (primes with odd index), A035363, A215366, A277579, A300063, A349151.
%K A349158 nonn
%O A349158 1,1
%A A349158 _Gus Wiseman_, Nov 12 2021