A299755 -id:A299755 - cp's OEIS frontend

A299756 Triangle read by rows in which row n is the finite increasing sequence, or set of positive integers, with FDH number n.

1, 2, 3, 4, 1, 2, 5, 1, 3, 6, 1, 4, 7, 2, 3, 8, 1, 5, 2, 4, 9, 10, 1, 6, 11, 3, 4, 2, 5, 1, 7, 12, 1, 2, 3, 13, 1, 8, 2, 6, 3, 5, 14, 1, 2, 4, 15, 1, 9, 2, 7, 1, 10, 4, 5, 3, 6, 16, 1, 11, 2, 8, 1, 3, 4, 17, 1, 2, 5, 18, 3, 7, 4, 6, 1, 12, 19, 2, 9, 20, 1, 13

Offset: 1

Gus Wiseman, Feb 18 2018

Let f(n) = A050376(n) be the n-th number of the form p^(2^k) where p is prime and k >= 0. The FDH number of a set S is Product_{x in S} f(x).

Same as A299755 with rows reversed.

			Sequence of sets begins: {}, {1}, {2}, {3}, {4}, {1,2}, {5}, {1,3}, {6}, {1,4}, {7}, {2,3}, {8}, {1,5}, {2,4}, {9}, {10}, {1,6}, {11}, {3,4}, {2,5}, {1,7}, {12}, {1,2,3}, {13}.

Row lengths are A064547.

Cf. A005117, A050376, A112798, A213925, A246867, A277098, A296150, A299090, A299755, A299757, A299759.

FDfactor[n_]:=If[n===1,{},Sort[Join@@Cases[FactorInteger[n],{p_,k_}:>Power[p,Cases[Position[IntegerDigits[k,2]//Reverse,1],{m_}->2^(m-1)]]]]];
nn=200;FDprimeList=Array[FDfactor,nn,1,Union];
FDrules=MapIndexed[(#1->#2[[1]])&,FDprimeList];
Join@@Table[FDfactor[n]/.FDrules,{n,60}]

A299759 Triangle read by rows in which row n lists in order all FDH numbers of strict integer partitions of n.

Original entry on oeis.org

1, 2, 3, 4, 6, 5, 8, 7, 10, 12, 9, 14, 15, 24, 11, 18, 20, 21, 30, 13, 22, 27, 28, 40, 42, 16, 26, 33, 35, 36, 54, 56, 60, 17, 32, 39, 44, 45, 66, 70, 72, 84, 120, 19, 34, 48, 52, 55, 63, 78, 88, 90, 105, 108, 168, 23, 38, 51, 64, 65, 77, 96, 104, 110, 126

Offset: 1

Gus Wiseman, Feb 18 2018

Let f(n) = A050376(n) be the n-th Fermi-Dirac prime. Every positive integer n has a unique factorization of the form n = f(s_1)*...*f(s_k) where the s_i are strictly increasing positive integers. This determines a unique strict integer partition (s_k...s_1) whose FDH number is then defined to be n.

This sequence is a permutation of the positive integers.

			Triangle of strict partitions begins:
                  0
                 (1)
                 (2)
               (3) (21)
               (4) (31)
             (5) (41) (32)
          (6) (51) (42) (321)
        (7) (61) (43) (52) (421)
     (8) (71) (62) (53) (431) (521)
(9) (81) (72) (54) (63) (621) (531) (432).

Cf. A050376, A056239, A064547, A106400, A122111, A213925, A215366, A246867, A279065, A279614, A299755, A299757, A299758.

Row lengths give A000009.

nn=25;
FDprimeList=Select[Range[nn],MatchQ[FactorInteger[#],{{?PrimeQ,?(MatchQ[FactorInteger[2#],{{2,_}}]&)}}]&];
Table[Sort[Times@@FDprimeList[[#]]&/@Select[IntegerPartitions[n],UnsameQ@@#&]],{n,0,Length[FDprimeList]}]

A319826 GCD of the strict integer partition with FDH number n; GCD of the indices (in A050376) of Fermi-Dirac prime factors of n.

Original entry on oeis.org

0, 1, 2, 3, 4, 1, 5, 1, 6, 1, 7, 1, 8, 1, 2, 9, 10, 1, 11, 1, 1, 1, 12, 1, 13, 1, 2, 1, 14, 1, 15, 1, 1, 1, 1, 3, 16, 1, 2, 1, 17, 1, 18, 1, 2, 1, 19, 1, 20, 1, 2, 1, 21, 1, 1, 1, 1, 1, 22, 1, 23, 1, 1, 3, 4, 1, 24, 1, 2, 1, 25, 1, 26, 1, 1, 1, 1, 1, 27, 1, 28

Offset: 1

Gus Wiseman, Sep 28 2018

nonn

Let f(n) = A050376(n) be the n-th Fermi-Dirac prime. The FDH number of a strict integer partition (y_1, ..., y_k) is f(y_1) * ... * f(y_k).

			45 is the FDH number of (6,4), which has GCD 2, so a(45) = 2.

Antti Karttunen, Table of n, a(n) for n = 1..16384

A left inverse of A050376.

Cf. A052331, A056239, A064547, A213925, A289508, A289509, A290103, A299755, A299757, A319825.

nn=200;
FDfactor[n_]:=If[n==1,{},Sort[Join@@Cases[FactorInteger[n],{p_,k_}:>Power[p,Cases[Position[IntegerDigits[k,2]//Reverse,1],{m_}->2^(m-1)]]]]];
FDprimeList=Array[FDfactor,nn,1,Union];FDrules=MapIndexed[(#1->#2[[1]])&,FDprimeList];
GCD@@@Table[Reverse[FDfactor[n]/.FDrules],{n,nn}]

A319826(n) = { my(i=1,g=0,x=A052331(n)); while(x,if(x%2,g = gcd(g,i)); x>>=1; i++); (g); }; \\ (Uses the program given in A052331) - Antti Karttunen, Feb 18 2023

For all n >= 1, a(A050376(n)) = n. - Antti Karttunen, Feb 18 2023

Secondary definition added by Antti Karttunen, Feb 18 2023

A344085 Triangle of squarefree numbers first grouped by greatest prime factor, then sorted by omega, then in increasing order, read by rows.

Original entry on oeis.org

1, 2, 3, 6, 5, 10, 15, 30, 7, 14, 21, 35, 42, 70, 105, 210, 11, 22, 33, 55, 77, 66, 110, 154, 165, 231, 385, 330, 462, 770, 1155, 2310, 13, 26, 39, 65, 91, 143, 78, 130, 182, 195, 273, 286, 429, 455, 715, 1001, 390, 546, 858, 910, 1365, 1430, 2002, 2145, 3003, 5005, 2730, 4290, 6006, 10010, 15015, 30030

Offset: 1

Gus Wiseman, May 11 2021

Differs from A339195 in having 77 before 66.

			Triangle begins:
   1
   2
   3   6
   5  10  15  30
   7  14  21  35  42  70 105 210

Row lengths are A000079.
Grouping by greatest prime factor only gives A339195.
Row sums are 1 and A339360.
Cf. A001221, A005117, A005183, A014466, A019565, A187769, A209862.
Partition/composition orderings: A026791, A026792, A026793, A036036, A036037, A048793, A066099, A080577, A112798, A118457, A124734, A162247, A193073, A211992, A228100, A228531, A246688, A272020, A299755, A296774, A304038, A319247, A329631, A334301, A334302, A334439, A334442, A335122, A344086, A344087, A344088, A344089.
Partition/composition applications: A001793, A036043, A049085, A070939, A115623, A124736, A129129, A185974, A238966, A294648, A333483, A333484, A333485, A333486, A334433, A334434, A334435, A334436, A334437, A334438, A334440, A334441, A335123, A335124.

nn=4;
GatherBy[SortBy[Select[Range[Times@@Prime/@Range[nn]],SquareFreeQ[#]&&PrimePi[FactorInteger[#][[-1,1]]]<=nn&],PrimeOmega],FactorInteger[#][[-1,1]]&]

A316271 FDH numbers of strict non-knapsack partitions.

Original entry on oeis.org

24, 40, 70, 84, 120, 126, 135, 168, 198, 210, 216, 220, 231, 264, 270, 280, 286, 312, 330, 351, 360, 364, 378, 384, 408, 416, 420, 440, 456, 462, 504, 520, 528, 540, 544, 546, 552, 560, 576, 594, 600, 616, 630, 640, 646, 660, 663, 680, 696, 702, 728, 744, 748

Offset: 1

Gus Wiseman, Jun 28 2018

nonn

A strict integer partition is knapsack if every subset has a different sum.

Let f(n) = A050376(n) be the n-th Fermi-Dirac prime. The FDH number of a strict integer partition (y_1,...,y_k) is f(y_1)*...*f(y_k).

			a(1) = 24 is the FDH number of (3,2,1), which is not knapsack because 3 = 2 + 1.

Cf. A000712, A005117, A050376, A056239, A064547, A108917, A213925, A275972, A284640, A299702, A299755, A299757, A301899, A301900.

nn=1000;
sksQ[ptn_]:=And[UnsameQ@@ptn,UnsameQ@@Plus@@@Union[Subsets[ptn]]];
FDfactor[n_]:=If[n==1,{},Sort[Join@@Cases[FactorInteger[n],{p_,k_}:>Power[p,Cases[Position[IntegerDigits[k,2]//Reverse,1],{m_}->2^(m-1)]]]]];
FDprimeList=Array[FDfactor,nn,1,Union];FDrules=MapIndexed[(#1->#2[[1]])&,FDprimeList];
Select[Range[nn],!sksQ[FDfactor[#]/.FDrules]&]

A319246 Sum of prime indices of the n-th squarefree number.

Original entry on oeis.org

0, 1, 2, 3, 3, 4, 4, 5, 6, 5, 5, 7, 8, 6, 6, 9, 7, 10, 6, 11, 7, 8, 7, 12, 9, 8, 13, 7, 14, 10, 15, 9, 16, 8, 10, 11, 17, 18, 12, 9, 8, 19, 11, 8, 20, 21, 13, 9, 9, 22, 14, 23, 10, 15, 12, 24, 10, 13, 16, 11, 25, 26, 10, 27, 9, 17, 28, 29, 9, 14, 30, 11, 12

Offset: 1

Gus Wiseman, Sep 15 2018

nonn

A prime index of n is a number m such that prime(m) divides n.

			The 19th squarefree number is 30 with prime indices (3,2,1), so a(19) = 6.

Rows sums of A319247.

Cf. A000720, A001222, A005117, A056239, A072047, A265668, A299755, A299757, A319241, A319242.

Table[Total[Cases[FactorInteger[n],{p_,k_}:>k*PrimePi[p]]],{n,Select[Range[100],SquareFreeQ]}]

A305830 Combined weight of the n-th FDH set-system. Factor n into distinct Fermi-Dirac primes (A050376), normalize by replacing every instance of the k-th Fermi-Dirac prime with k, then add up their FD-weights (A064547).

Original entry on oeis.org

0, 0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 3, 2, 2, 2, 2, 1, 2, 2, 2, 3, 1, 1, 3, 2, 1, 2, 2, 2, 3, 2, 1, 2, 2, 1, 3, 3, 2, 3, 2, 2, 2, 2, 2, 3, 1, 2, 3, 2, 3, 2, 3, 3, 3, 2, 1, 3, 2, 1, 2, 2, 2, 3, 2, 2, 2, 1, 1, 3, 3, 2, 3

Offset: 1

Gus Wiseman, Jun 10 2018

nonn

Let f(n) = A050376(n) be the n-th Fermi-Dirac prime. Every positive integer n has a unique factorization of the form n = f(s_1)*...*f(s_k) where the s_i are strictly increasing positive integers. Then a(n) = w(s_1) + ... + w(s_k) where w = A064547.

			Sequence of FDH set-systems (a list containing all finite sets of finite sets of positive integers) begins:
   1: {}
   2: {{}}
   3: {{1}}
   4: {{2}}
   5: {{3}}
   6: {{},{1}}
   7: {{4}}
   8: {{},{2}}
   9: {{1,2}}
  10: {{},{3}}
  11: {{5}}
  12: {{1},{2}}
  13: {{1,3}}
  14: {{},{4}}
  15: {{1},{3}}
  16: {{6}}
  17: {{1,4}}
  18: {{},{1,2}}
  19: {{7}}
  20: {{2},{3}}
  21: {{1},{4}}
  22: {{},{5}}
  23: {{2,3}}
  24: {{},{1},{2}}
  25: {{8}}
  26: {{},{1,3}}
  27: {{1},{1,2}}

Cf. A003963, A050376, A056239, A061775, A064547, A213925, A279065, A279614, A299755, A299756, A299757, A302242, A302243, A305829, A305832.

nn=100;
FDfactor[n_]:=If[n===1,{},Sort[Join@@Cases[FactorInteger[n],{p_,k_}:>Power[p,Cases[Position[IntegerDigits[k,2]//Reverse,1],{m_}->2^(m-1)]]]]];
FDprimeList=Array[FDfactor,nn,1,Union];FDrules=MapIndexed[(#1->#2[[1]])&,FDprimeList];
Table[Total[Length/@(FDfactor/@(FDfactor[n]/.FDrules))],{n,nn}]

A344087 Flattened tetrangle of strict integer partitions sorted first by sum, then colexicographically.

Original entry on oeis.org

1, 2, 2, 1, 3, 3, 1, 4, 4, 1, 3, 2, 5, 3, 2, 1, 5, 1, 4, 2, 6, 4, 2, 1, 6, 1, 5, 2, 4, 3, 7, 5, 2, 1, 4, 3, 1, 7, 1, 6, 2, 5, 3, 8, 6, 2, 1, 5, 3, 1, 8, 1, 4, 3, 2, 7, 2, 6, 3, 5, 4, 9, 4, 3, 2, 1, 7, 2, 1, 6, 3, 1, 5, 4, 1, 9, 1, 5, 3, 2, 8, 2, 7, 3, 6, 4, 10

Offset: 0

Gus Wiseman, May 11 2021

The zeroth row contains only the empty partition.

A tetrangle is a sequence of finite triangles.

			Tetrangle begins:
  0: ()
  1: (1)
  2: (2)
  3: (21)(3)
  4: (31)(4)
  5: (41)(32)(5)
  6: (321)(51)(42)(6)
  7: (421)(61)(52)(43)(7)
  8: (521)(431)(71)(62)(53)(8)
  9: (621)(531)(81)(432)(72)(63)(54)(9)

Wikiversity, Lexicographic and colexicographic order

Positions of first appearances are A015724.
Triangle sums are A066189.
Taking revlex instead of colex gives A118457.
The not necessarily strict version is A211992.
Taking lex instead of colex gives A344086.
A026793 gives reversed strict partitions in A-S order (sum/length/lex).
A319247 sorts strict partitions by Heinz number.
A329631 sorts reversed strict partitions by Heinz number.
A344090 gives strict partitions in A-S order (sum/length/lex).
Cf. A005117, A014466, A209862.
Partition/composition orderings: A026791, A026792, A036036, A036037, A048793, A066099, A080576, A080577, A112798, A124734, A162247, A193073, A211992, A228100, A228351, A228531, A246688, A272020, A299755, A296774, A304038, A319247, A334301, A334302, A334439, A334442, A335122, A339351, A344085, A344086, A344088, A344089, A344091.
Partition/composition applications: A001793, A005183, A036043, A049085, A070939, A115623, A124736, A129129, A185974, A238966, A246867, A294648, A333483, A333484, A333485, A333486, A334433, A334434, A334435, A334436, A334437, A334438, A334440, A334441, A335123, A335124, A339195.

colex[f_,c_]:=OrderedQ[PadRight[{Reverse[f],Reverse[c]}]];
Table[Sort[Select[IntegerPartitions[n],UnsameQ@@#&],colex],{n,0,10}]

A344088 Flattened tetrangle of reversed strict integer partitions sorted first by sum, then colexicographically.

Original entry on oeis.org

1, 2, 1, 2, 3, 1, 3, 4, 2, 3, 1, 4, 5, 1, 2, 3, 2, 4, 1, 5, 6, 1, 2, 4, 3, 4, 2, 5, 1, 6, 7, 1, 3, 4, 1, 2, 5, 3, 5, 2, 6, 1, 7, 8, 2, 3, 4, 1, 3, 5, 4, 5, 1, 2, 6, 3, 6, 2, 7, 1, 8, 9, 1, 2, 3, 4, 2, 3, 5, 1, 4, 5, 1, 3, 6, 4, 6, 1, 2, 7, 3, 7, 2, 8, 1, 9, 10

Offset: 0

Gus Wiseman, May 12 2021

The zeroth row contains only the empty partition.

A tetrangle is a sequence of finite triangles.

			Tetrangle begins:
  0: ()
  1: (1)
  2: (2)
  3: (12)(3)
  4: (13)(4)
  5: (23)(14)(5)
  6: (123)(24)(15)(6)
  7: (124)(34)(25)(16)(7)
  8: (134)(125)(35)(26)(17)(8)
  9: (234)(135)(45)(126)(36)(27)(18)(9)

Wikiversity, Lexicographic and colexicographic order

Positions of first appearances are A015724.
Triangle sums are A066189.
The non-strict version is A080576.
Taking lex instead of colex gives A246688 (non-reversed: A344086).
The non-reversed version is A344087.
Taking revlex instead of colex gives A344089 (non-reversed: A118457).
A026793 gives reversed strict partitions in A-S order (sum/length/lex).
A319247 sorts strict partitions by Heinz number.
A329631 sorts reversed strict partitions by Heinz number.
A344090 gives strict partitions in A-S order (sum/length/lex).
Cf. A005117, A014466, A209862.
Partition/composition orderings: A026791, A026792, A036036, A036037, A048793, A066099, A080577, A112798, A124734, A162247, A193073, A211992, A228100, A228351, A228531, A272020, A299755, A296774, A304038, A334301, A334302, A334439, A334442, A335122, A339351, A344085, A344086, A344091.
Partition/composition applications: A001793, A005183, A036043, A049085, A070939, A115623, A124736, A129129, A185974, A238966, A246867, A294648, A333483, A333484, A333485, A333486, A334433, A334434, A334435, A334436, A334437, A334438, A334440, A334441, A335123, A335124, A339195.

colex[f_,c_]:=OrderedQ[PadRight[{Reverse[f],Reverse[c]}]];
Table[Sort[Reverse/@Select[IntegerPartitions[n],UnsameQ@@#&],colex],{n,0,10}]

A316202 Number of integer partitions of n into Fermi-Dirac primes.

Original entry on oeis.org

1, 0, 1, 1, 2, 2, 3, 4, 5, 7, 8, 11, 13, 17, 20, 25, 31, 37, 45, 54, 65, 77, 92, 109, 128, 152, 177, 208, 242, 283, 327, 380, 439, 506, 583, 669, 768, 878, 1004, 1144, 1303, 1482, 1681, 1906, 2156, 2438, 2750, 3101, 3490, 3924, 4407, 4942, 5538, 6197, 6929

Offset: 0

Gus Wiseman, Jun 26 2018

nonn

A Fermi-Dirac prime (A050376) is a number of the form p^(2^k) where p is prime and k >= 0.

			The a(12) = 13 integer partitions of 12 into Fermi-Dirac primes:
(75), (93),
(444), (543), (552), (732),
(3333), (4332), (4422), (5322),
(33222), (42222),
(222222).

Cf. A000586, A000607, A050376, A064547, A213925, A279065, A299755, A299757, A305829.

nn=60;
FDpQ[n_]:=With[{f=FactorInteger[n]},n>1&&Length[f]==1&&MatchQ[FactorInteger[2f[[1,2]]],{{2,_}}]]
FDprimeList=Select[Range[nn],FDpQ];
ser=Product[1/(1-x^d),{d,FDprimeList}];
Table[SeriesCoefficient[ser,{x,0,n}],{n,0,nn}]

O.g.f.: Product_d 1/(1 - x^d) where the product is over all Fermi-Dirac primes (A050376).

cp's OEIS Frontend

A299756 Triangle read by rows in which row n is the finite increasing sequence, or set of positive integers, with FDH number n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A299759 Triangle read by rows in which row n lists in order all FDH numbers of strict integer partitions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A319826 GCD of the strict integer partition with FDH number n; GCD of the indices (in A050376) of Fermi-Dirac prime factors of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A344085 Triangle of squarefree numbers first grouped by greatest prime factor, then sorted by omega, then in increasing order, read by rows.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A316271 FDH numbers of strict non-knapsack partitions.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A319246 Sum of prime indices of the n-th squarefree number.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A305830 Combined weight of the n-th FDH set-system. Factor n into distinct Fermi-Dirac primes (A050376), normalize by replacing every instance of the k-th Fermi-Dirac prime with k, then add up their FD-weights (A064547).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A344087 Flattened tetrangle of strict integer partitions sorted first by sum, then colexicographically.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A344088 Flattened tetrangle of reversed strict integer partitions sorted first by sum, then colexicographically.

Views