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.

Previous Showing 11-16 of 16 results.

A362980 Numbers whose multiset of prime factors (with multiplicity) has different median from maximum.

Original entry on oeis.org

6, 10, 12, 14, 15, 20, 21, 22, 24, 26, 28, 30, 33, 34, 35, 36, 38, 39, 40, 42, 44, 45, 46, 48, 51, 52, 55, 56, 57, 58, 60, 62, 63, 65, 66, 68, 69, 70, 72, 74, 76, 77, 78, 80, 82, 84, 85, 86, 87, 88, 90, 91, 92, 93, 94, 95, 96, 99, 100, 102, 104, 105, 106, 110
Offset: 1

Views

Author

Gus Wiseman, May 12 2023

Keywords

Comments

The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).

Examples

			The prime factorization of 108 is 2*2*3*3*3, and the multiset {2,2,3,3,3} has median 3 and maximum 3, so 108 is not in the sequence.
The prime factorization of 2250 is 2*3*3*5*5*5, and the multiset {2,3,3,5,5,5} has median 4 and maximum 5, so 2250 is in the sequence.
The terms together with their prime indices begin:
     6: {1,2}        36: {1,1,2,2}      60: {1,1,2,3}
    10: {1,3}        38: {1,8}          62: {1,11}
    12: {1,1,2}      39: {2,6}          63: {2,2,4}
    14: {1,4}        40: {1,1,1,3}      65: {3,6}
    15: {2,3}        42: {1,2,4}        66: {1,2,5}
    20: {1,1,3}      44: {1,1,5}        68: {1,1,7}
    21: {2,4}        45: {2,2,3}        69: {2,9}
    22: {1,5}        46: {1,9}          70: {1,3,4}
    24: {1,1,1,2}    48: {1,1,1,1,2}    72: {1,1,1,2,2}
    26: {1,6}        51: {2,7}          74: {1,12}
    28: {1,1,4}      52: {1,1,6}        76: {1,1,8}
    30: {1,2,3}      55: {3,5}          77: {4,5}
    33: {2,5}        56: {1,1,1,4}      78: {1,2,6}
    34: {1,7}        57: {2,8}          80: {1,1,1,1,3}
    35: {3,4}        58: {1,10}         82: {1,13}
		

Crossrefs

Partitions of this type are counted by A237821.
For mode instead of median we have A362620, counted by A240302.
The complement is A362621, counted by A053263.
A027746 lists prime factors, A112798 indices, length A001222, sum A056239.
A362611 counts modes in prime factorization, triangle version A362614.
A362613 counts co-modes in prime factorization, triangle version A362615.

Programs

  • Mathematica
    Select[Range[100],(y=Flatten[Apply[ConstantArray,FactorInteger[#],{1}]];Max@@y!=Median[y])&]

A362981 Heinz numbers of integer partitions such that 2*(least part) >= greatest part.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 15, 16, 17, 18, 19, 21, 23, 24, 25, 27, 29, 31, 32, 35, 36, 37, 41, 43, 45, 47, 48, 49, 53, 54, 55, 59, 61, 63, 64, 65, 67, 71, 72, 73, 75, 77, 79, 81, 83, 89, 91, 96, 97, 101, 103, 105, 107, 108, 109, 113, 119, 121, 125
Offset: 1

Views

Author

Gus Wiseman, May 14 2023

Keywords

Comments

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.
By conjugation, also Heinz numbers of partitions whose greatest part appears at a middle position, namely k/2, (k+1)/2, or (k+2)/2, where k is the number of parts. These partitions have ranks A362622.

Examples

			The terms together with their prime indices begin:
     1: {}         16: {1,1,1,1}      36: {1,1,2,2}
     2: {1}        17: {7}            37: {12}
     3: {2}        18: {1,2,2}        41: {13}
     4: {1,1}      19: {8}            43: {14}
     5: {3}        21: {2,4}          45: {2,2,3}
     6: {1,2}      23: {9}            47: {15}
     7: {4}        24: {1,1,1,2}      48: {1,1,1,1,2}
     8: {1,1,1}    25: {3,3}          49: {4,4}
     9: {2,2}      27: {2,2,2}        53: {16}
    11: {5}        29: {10}           54: {1,2,2,2}
    12: {1,1,2}    31: {11}           55: {3,5}
    13: {6}        32: {1,1,1,1,1}    59: {17}
    15: {2,3}      35: {3,4}          61: {18}
		

Crossrefs

For prime factors instead of indices we have A081306.
Prime indices are listed by A112798, length A001222, sum A056239.
The complement is A362982, counted by A237820.
Partitions of this type are counted by A237824.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    Select[Range[100],2*Min@@prix[#]>=Max@@prix[#]&]

A362982 Heinz numbers of partitions such that 2*(least part) < greatest part.

Original entry on oeis.org

10, 14, 20, 22, 26, 28, 30, 33, 34, 38, 39, 40, 42, 44, 46, 50, 51, 52, 56, 57, 58, 60, 62, 66, 68, 69, 70, 74, 76, 78, 80, 82, 84, 85, 86, 87, 88, 90, 92, 93, 94, 95, 98, 99, 100, 102, 104, 106, 110, 111, 112, 114, 115, 116, 117, 118, 120, 122, 123, 124, 126
Offset: 1

Views

Author

Gus Wiseman, May 14 2023

Keywords

Comments

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.

Examples

			The terms together with their prime indices begin:
    10: {1,3}        44: {1,1,5}      70: {1,3,4}
    14: {1,4}        46: {1,9}        74: {1,12}
    20: {1,1,3}      50: {1,3,3}      76: {1,1,8}
    22: {1,5}        51: {2,7}        78: {1,2,6}
    26: {1,6}        52: {1,1,6}      80: {1,1,1,1,3}
    28: {1,1,4}      56: {1,1,1,4}    82: {1,13}
    30: {1,2,3}      57: {2,8}        84: {1,1,2,4}
    33: {2,5}        58: {1,10}       85: {3,7}
    34: {1,7}        60: {1,1,2,3}    86: {1,14}
    38: {1,8}        62: {1,11}       87: {2,10}
    39: {2,6}        66: {1,2,5}      88: {1,1,1,5}
    40: {1,1,1,3}    68: {1,1,7}      90: {1,2,2,3}
    42: {1,2,4}      69: {2,9}        92: {1,1,9}
		

Crossrefs

For prime factors instead of indices we have A069900, complement A081306.
Prime indices are listed by A112798, length A001222, sum A056239.
Partitions of this type are counted by A237820.
The complement is A362981, counted by A237824.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    Select[Range[100],2*Min@@prix[#]
    				

A363211 Number of partitions of n such that 3*(least part) <= greatest part.

Original entry on oeis.org

0, 0, 0, 1, 2, 4, 7, 12, 18, 27, 39, 56, 78, 106, 143, 193, 254, 333, 432, 560, 717, 914, 1157, 1461, 1833, 2292, 2849, 3536, 4362, 5372, 6587, 8062, 9825, 11951, 14487, 17533, 21150, 25469, 30583, 36670, 43850, 52357, 62366, 74184, 88048, 104359, 123442, 145826, 171946, 202487
Offset: 1

Views

Author

Seiichi Manyama, May 27 2023

Keywords

Crossrefs

Programs

Formula

G.f.: Sum_{i>=1} Sum_{j>=0} x^(4*i+j) /Product_{k=i..3*i+j} (1-x^k).

A363222 Numbers whose multiset of prime indices satisfies (maximum) - (minimum) = (length).

Original entry on oeis.org

10, 21, 28, 42, 55, 70, 88, 91, 98, 99, 132, 165, 187, 198, 208, 220, 231, 247, 308, 312, 325, 330, 351, 363, 391, 455, 462, 468, 484, 520, 544, 550, 551, 585, 702, 713, 715, 726, 728, 770, 780, 816, 819, 833, 845, 975, 1073, 1078, 1092, 1144, 1170, 1210, 1216
Offset: 1

Views

Author

Gus Wiseman, May 29 2023

Keywords

Comments

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

Examples

			The terms together with their prime indices begin:
    10: {1,3}
    21: {2,4}
    28: {1,1,4}
    42: {1,2,4}
    55: {3,5}
    70: {1,3,4}
    88: {1,1,1,5}
    91: {4,6}
    98: {1,4,4}
    99: {2,2,5}
   132: {1,1,2,5}
   165: {2,3,5}
   187: {5,7}
   198: {1,2,2,5}
		

Crossrefs

The RHS is A001222.
Partitions of this type are counted by A237832.
The LHS (maximum minus minimum) is A243055.
A001221 (omega) counts distinct prime factors.
A112798 lists prime indices, sum A056239.
A360005 gives median of prime indices, distinct A360457.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    Select[Range[100],Max@@prix[#]-Min@@prix[#]==Length[prix[#]]&]

Formula

A061395(a(n)) - A055396(a(n)) = A001222(a(n)).

A363276 Number of partitions of n such that 4*(least part) <= greatest part.

Original entry on oeis.org

0, 0, 0, 0, 1, 2, 4, 7, 12, 19, 29, 42, 61, 85, 119, 161, 217, 288, 380, 496, 643, 826, 1055, 1340, 1695, 2129, 2663, 3316, 4113, 5084, 6260, 7681, 9394, 11456, 13929, 16892, 20428, 24646, 29658, 35618, 42669, 51021, 60872, 72496, 86165, 102239, 121078, 143171, 168995, 199187, 234380, 275414
Offset: 1

Views

Author

Seiichi Manyama, May 27 2023

Keywords

Crossrefs

Formula

G.f.: Sum_{i>=1} Sum_{j>=0} x^(5*i+j) /Product_{k=i..4*i+j} (1-x^k).
Previous Showing 11-16 of 16 results.