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!)
A342522 Heinz numbers of integer partitions with constant (equal) first quotients. 8

%I #8 Mar 23 2021 16:10:28

%S 1,2,3,4,5,6,7,8,9,10,11,13,14,15,16,17,19,21,22,23,25,26,27,29,31,32,

%T 33,34,35,37,38,39,41,42,43,46,47,49,51,53,55,57,58,59,61,62,64,65,67,

%U 69,71,73,74,77,79,81,82,83,85,86,87,89,91,93,94,95,97

%N Heinz numbers of integer partitions with constant (equal) first quotients.

%C The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This gives a bijective correspondence between positive integers and integer partitions.

%C The first quotients of a sequence are defined as if the sequence were an increasing divisor chain, so for example the first quotients of (6,3,1) are (1/2,1/3).

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/LogarithmicallyConcaveSequence.html">Logarithmically Concave Sequence</a>.

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Arithmetic_progression">Arithmetic progression</a>

%H Gus Wiseman, <a href="/A069916/a069916.txt">Sequences counting and ranking partitions and compositions by their differences and quotients.</a>

%e The prime indices of 2093 are {4,6,9}, with first quotients (3/2,3/2), so 2093 is in the sequence.

%e Most small numbers are in the sequence, but the sequence of non-terms together with their prime indices begins:

%e 12: {1,1,2}

%e 18: {1,2,2}

%e 20: {1,1,3}

%e 24: {1,1,1,2}

%e 28: {1,1,4}

%e 30: {1,2,3}

%e 36: {1,1,2,2}

%e 40: {1,1,1,3}

%e 44: {1,1,5}

%e 45: {2,2,3}

%e 48: {1,1,1,1,2}

%e 50: {1,3,3}

%e 52: {1,1,6}

%e 54: {1,2,2,2}

%e 56: {1,1,1,4}

%e 60: {1,1,2,3}

%e 63: {2,2,4}

%e 66: {1,2,5}

%t primeptn[n_]:=If[n==1,{},Reverse[Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]];

%t Select[Range[100],SameQ@@Divide@@@Reverse/@Partition[primeptn[#],2,1]&]

%Y For multiplicities (prime signature) instead of quotients we have A072774.

%Y The version counting strict divisor chains is A169594.

%Y For differences instead of quotients we have A325328 (count: A049988).

%Y These partitions are counted by A342496 (strict: A342515, ordered: A342495).

%Y The distinct instead of equal version is A342521.

%Y A000005 count constant partitions.

%Y A000041 counts partitions (strict: A000009).

%Y A001055 counts factorizations (strict: A045778, ordered: A074206).

%Y A003238 counts chains of divisors summing to n - 1 (strict: A122651).

%Y A167865 counts strict chains of divisors > 1 summing to n.

%Y A318991/A318992 rank reversed partitions with/without integer quotients.

%Y A342086 counts strict chains of divisors with strictly increasing quotients.

%Y Cf. A003242, A047966, A049980, A056239, A067824, A112798, A118914, A124010, A130091, A181819, A325351, A325352.

%K nonn

%O 1,2

%A _Gus Wiseman_, Mar 23 2021

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 3 20:33 EDT 2024. Contains 374905 sequences. (Running on oeis4.)