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 21-30 of 120 results. Next

A326027 Number of nonempty subsets of {1..n} whose geometric mean is an integer.

Original entry on oeis.org

0, 1, 2, 3, 6, 7, 8, 9, 12, 19, 20, 21, 28, 29, 30, 31, 40, 41, 70, 71, 74, 75, 76, 77, 108, 123, 124, 211, 214, 215, 216, 217, 332, 333, 334, 335, 592, 593, 594, 595, 612, 613, 614, 615, 618, 639, 640, 641, 1160, 1183, 1324, 1325, 1328, 1329, 2176, 2177, 2196, 2197, 2198, 2199, 2414, 2415, 2416, 2443, 4000, 4001, 4002, 4003, 4006, 4007, 4008, 4009, 6626, 6627, 6628, 9753, 9756, 9757, 9758, 9759, 11136
Offset: 0

Views

Author

Gus Wiseman, Jul 14 2019

Keywords

Examples

			The a(1) = 1 through a(9) = 19 subsets:
  {1}  {1}  {1}  {1}      {1}      {1}      {1}      {1}      {1}
       {2}  {2}  {2}      {2}      {2}      {2}      {2}      {2}
            {3}  {3}      {3}      {3}      {3}      {3}      {3}
                 {4}      {4}      {4}      {4}      {4}      {4}
                 {1,4}    {5}      {5}      {5}      {5}      {5}
                 {1,2,4}  {1,4}    {6}      {6}      {6}      {6}
                          {1,2,4}  {1,4}    {7}      {7}      {7}
                                   {1,2,4}  {1,4}    {8}      {8}
                                            {1,2,4}  {1,4}    {9}
                                                     {2,8}    {1,4}
                                                     {1,2,4}  {1,9}
                                                     {2,4,8}  {2,8}
                                                              {4,9}
                                                              {1,2,4}
                                                              {1,3,9}
                                                              {2,4,8}
                                                              {3,8,9}
                                                              {4,6,9}
                                                              {3,6,8,9}
		

Crossrefs

First differences are A082553.
Partitions whose geometric mean is an integer are A067539.
Strict partitions whose geometric mean is an integer are A326625.
Subsets whose average is an integer are A051293.

Programs

  • Mathematica
    Table[Length[Select[Subsets[Range[n]],IntegerQ[GeometricMean[#]]&]],{n,0,10}]

Formula

a(n) = A357413(n) + A357414(n). For a squarefree n, a(n) = a(n-1) + 1. - Max Alekseyev, Mar 01 2025

Extensions

Terms a(57) onward from Max Alekseyev, Mar 01 2025

A363723 Number of integer partitions of n having a unique mode equal to the mean, i.e., partitions whose mean appears more times than each of the other parts.

Original entry on oeis.org

0, 1, 2, 2, 3, 2, 4, 2, 5, 3, 5, 2, 10, 2, 7, 7, 12, 2, 18, 2, 24, 16, 13, 2, 60, 15, 18, 37, 60, 2, 129, 2, 104, 80, 35, 104, 352, 2, 49, 168, 501, 2, 556, 2, 489, 763, 92, 2, 1799, 292, 985, 649, 1296, 2, 2233, 1681, 3379, 1204, 225, 2, 10661
Offset: 0

Views

Author

Gus Wiseman, Jun 24 2023

Keywords

Comments

A mode in a multiset is an element that appears at least as many times as each of the others. For example, the modes in {a,a,b,b,b,c,d,d,d} are {b,d}.

Examples

			The a(n) partitions for n = 6, 8, 12, 14, 16 (A..G = 10..16):
  (6)       (8)         (C)             (E)               (G)
  (33)      (44)        (66)            (77)              (88)
  (222)     (2222)      (444)           (2222222)         (4444)
  (111111)  (3221)      (3333)          (3222221)         (5443)
            (11111111)  (4332)          (3322211)         (6442)
                        (5331)          (4222211)         (7441)
                        (222222)        (11111111111111)  (22222222)
                        (322221)                          (32222221)
                        (422211)                          (33222211)
                        (111111111111)                    (42222211)
                                                          (52222111)
                                                          (1111111111111111)
		

Crossrefs

Partitions containing their mean are counted by A237984, ranks A327473.
For median instead of mode we have A240219, ranks A359889.
Partitions missing their mean are counted by A327472, ranks A327476.
The case of non-constant partitions is A362562.
Including median also gives A363719, ranks A363727.
Allowing multiple modes gives A363724.
Requiring multiple modes gives A363731.
For median instead of mean we have A363740.
A000041 counts partitions, strict A000009.
A008284 counts partitions by length (or decreasing mean), strict A008289.
A359893 and A359901 count partitions by median.
A362608 counts partitions with a unique mode.

Programs

  • Mathematica
    modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
    Table[Length[Select[IntegerPartitions[n],{Mean[#]}==modes[#]&]],{n,30}]

A326620 Denominator of the average of the set of distinct prime indices of n.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 1, 1, 1, 3, 1, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 2, 3, 1, 2, 1, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 3, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 3, 1, 2, 1
Offset: 2

Views

Author

Gus Wiseman, Jul 14 2019

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 distinct prime indices of 12 are {1,2}, with average 3/2, so a(12) = 2.
The sequence of fractions begins: 1, 2, 1, 3, 3/2, 4, 1, 2, 2, 5, 3/2, 6, 5/2, 5/2, 1, 7, 3/2, 8, 2, 3, 3, 9, 3/2, 3, 7/2, 2, 5/2, 10, 2.
		

Crossrefs

Positions of 1's are A326621.
The average of the multiset of prime indices is A326567/A326568.
The average of the multiset of prime factors is A123528/A123529.
The average of the set of distinct prime indices is A326619/A326620.
The average of the set of distinct prime factors is A323171/A323172.

Programs

  • Mathematica
    Table[Denominator[Mean[PrimePi/@First/@FactorInteger[n]]],{n,2,100}]
  • PARI
    A326620(n) = if(1==n,0,denominator(vecsum(apply(primepi,factor(n)[,1]))/omega(n))); \\ Antti Karttunen, Jan 28 2025

Extensions

Data section extended to a(105) by Antti Karttunen, Jan 28 2025

A348551 Heinz numbers of integer partitions whose mean is not an integer.

Original entry on oeis.org

1, 6, 12, 14, 15, 18, 20, 24, 26, 33, 35, 36, 38, 40, 42, 44, 45, 48, 50, 51, 52, 54, 56, 58, 60, 63, 65, 66, 69, 70, 72, 74, 75, 76, 77, 80, 86, 92, 93, 95, 96, 102, 104, 106, 108, 112, 114, 117, 119, 120, 122, 123, 124, 126, 130, 132, 135, 136, 140, 141, 142
Offset: 1

Views

Author

Gus Wiseman, Nov 14 2021

Keywords

Comments

Equivalently, partitions whose length does not divide their sum.
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 and their prime indices begin:
   1: {}
   6: {1,2}
  12: {1,1,2}
  14: {1,4}
  15: {2,3}
  18: {1,2,2}
  20: {1,1,3}
  24: {1,1,1,2}
  26: {1,6}
  33: {2,5}
  35: {3,4}
  36: {1,1,2,2}
  38: {1,8}
  40: {1,1,1,3}
  42: {1,2,4}
  44: {1,1,5}
  45: {2,2,3}
  48: {1,1,1,1,2}
		

Crossrefs

A version counting nonempty subsets is A000079 - A051293.
A version counting factorizations is A001055 - A326622.
A version counting compositions is A011782 - A271654.
A version for prime factors is A175352, complement A078175.
A version for distinct prime factors A176587, complement A078174.
The complement is A316413, counted by A067538, strict A102627.
The geometric version is the complement of A326623.
The conjugate version is the complement of A326836.
These partitions are counted by A349156.
A000041 counts partitions.
A001222 counts prime factors with multiplicity.
A018818 counts partitions into divisors, ranked by A326841.
A143773 counts partitions into multiples of the length, ranked by A316428.
A236634 counts unbalanced partitions.
A047993 counts balanced partitions, ranked by A106529.
A056239 adds up prime indices, row sums of A112798.
A326567/A326568 gives the mean of prime indices, conjugate A326839/A326840.
A327472 counts partitions not containing their mean, complement A237984.

Programs

  • Maple
    q:= n-> (l-> nops(l)=0 or irem(add(i, i=l), nops(l))>0)(map
            (i-> numtheory[pi](i[1])$i[2], ifactors(n)[2])):
    select(q, [$1..142])[];  # Alois P. Heinz, Nov 19 2021
  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    Select[Range[100],!IntegerQ[Mean[primeMS[#]]]&]

A326619 Numerator of the average of the set of distinct prime indices of n.

Original entry on oeis.org

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

Views

Author

Gus Wiseman, Jul 14 2019

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 distinct prime indices of 12 are {1,2}, with average 3/2, so a(12) = 3.
The sequence of fractions begins: 1, 2, 1, 3, 3/2, 4, 1, 2, 2, 5, 3/2, 6, 5/2, 5/2, 1, 7, 3/2, 8, 2, 3, 3, 9, 3/2, 3, 7/2, 2, 5/2, 10, 2.
		

Crossrefs

The average of the multiset of prime indices is A326567/A326568.
The average of the multiset of prime factors is A123528/A123529.
The average of the set of distinct prime indices is A326619/A326620.
The average of the set of distinct prime factors is A323171/A323172.

Programs

  • Mathematica
    Table[Numerator[Mean[PrimePi/@First/@FactorInteger[n]]],{n,2,100}]

A359890 Numbers whose prime indices do not have the same mean as median.

Original entry on oeis.org

12, 18, 20, 24, 28, 40, 42, 44, 45, 48, 50, 52, 54, 56, 60, 63, 66, 68, 70, 72, 75, 76, 78, 80, 84, 88, 92, 96, 98, 99, 102, 104, 108, 112, 114, 116, 117, 120, 124, 126, 130, 132, 135, 136, 138, 140, 144, 147, 148, 150, 152, 153, 154, 156, 160, 162, 164, 165
Offset: 1

Views

Author

Gus Wiseman, Jan 22 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.
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 terms together with their prime indices begin:
   12: {1,1,2}
   18: {1,2,2}
   20: {1,1,3}
   24: {1,1,1,2}
   28: {1,1,4}
   40: {1,1,1,3}
   42: {1,2,4}
   44: {1,1,5}
   45: {2,2,3}
   48: {1,1,1,1,2}
For example, the prime indices of 360 are {1,1,1,2,2,3}, with mean 5/3 and median 3/2, so 360 is in the sequence.
		

Crossrefs

The LHS (mean of prime indices) is A326567/A326568.
The complement is A359889, counted by A240219.
The odd-length case is A359891, complement A359892.
These partitions are counted by A359894.
The strict case is counted by A359898, odd-length A359900.
The RHS (median of prime indices) is A360005/2.
A058398 counts partitions by mean, see also A008284, A327482.
A088529/A088530 gives mean of prime signature A124010.
A112798 lists prime indices, length A001222, sum A056239.
A316413 lists numbers whose prime indices have integer mean.
A359908 lists numbers whose prime indices have integer median.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    Select[Range[1000],Mean[prix[#]]!=Median[prix[#]]&]

A360006 Least positive integer whose prime indices have median n/2. a(1) = 1.

Original entry on oeis.org

1, 2, 6, 3, 14, 5, 26, 7, 38, 11, 58, 13, 74, 17, 86, 19, 106, 23, 122, 29, 142, 31, 158, 37, 178, 41, 202, 43, 214, 47, 226, 53, 262, 59, 278, 61, 302, 67, 326, 71, 346, 73, 362, 79, 386, 83, 398, 89, 446, 97, 458, 101, 478, 103, 502, 107, 526, 109, 542, 113
Offset: 1

Views

Author

Gus Wiseman, Jan 24 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.
The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).

Crossrefs

Position of first appearance of n in A360005.
The sorted version is A360007, for mean A360008.
A112798 lists prime indices, length A001222, sum A056239.
A316413 lists numbers whose prime indices have integer mean.
A325347 = partitions w/ integer median, strict A359907, complement A307683.
A326567/A326568 gives mean of prime indices.
A359893 counts partitions by median, cf. A359901, A359902.
A359908 = numbers w/ integer median of prime indices, complement A359912.

Programs

  • Mathematica
    nn=100;
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    seq=Table[If[n==1,1,2*Median[prix[n]]],{n,nn}];
    Table[Position[seq,k][[1,1]],{k,Count[Differences[Union[seq]],1]}]

Formula

Consists of 1 followed by A000040 interleaved with 2*A031215.

A326621 Numbers n such that the average of the set of distinct prime indices of n is an integer.

Original entry on oeis.org

2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 16, 17, 19, 20, 21, 22, 23, 25, 27, 29, 30, 31, 32, 34, 37, 39, 40, 41, 43, 44, 46, 47, 49, 50, 53, 55, 57, 59, 60, 61, 62, 63, 64, 67, 68, 71, 73, 78, 79, 80, 81, 82, 83, 85, 87, 88, 89, 90, 91, 92, 94, 97, 100, 101, 103, 105
Offset: 1

Views

Author

Gus Wiseman, Jul 14 2019

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.
The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), so these are Heinz numbers of integer partitions whose distinct parts have an integer average.

Examples

			The sequence of terms together with their prime indices begins:
    2: {1}
    3: {2}
    4: {1,1}
    5: {3}
    7: {4}
    8: {1,1,1}
    9: {2,2}
   10: {1,3}
   11: {5}
   13: {6}
   16: {1,1,1,1}
   17: {7}
   19: {8}
   20: {1,1,3}
   21: {2,4}
   22: {1,5}
   23: {9}
   25: {3,3}
   27: {2,2,2}
   29: {10}
		

Crossrefs

Programs

  • Mathematica
    Select[Range[2,100],IntegerQ[Mean[PrimePi/@First/@FactorInteger[#]]]&]

A363486 Low mode in the multiset of prime indices of n.

Original entry on oeis.org

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

Views

Author

Gus Wiseman, Jun 23 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.
A mode in a multiset is an element that appears at least as many times as each of the others. For example, the modes in {a,a,b,b,b,c,d,d,d} are {b,d}.
Extending the terminology of A124943, the "low mode" in a multiset is its least mode.

Crossrefs

Positions of first appearances are 1 and A000040.
Positions of 1's are A360013, counted by A241131.
For greatest instead of least we have A363487.
The version for median is A363941, triangle A124943.
The high version for median is A363942, triangle A124944.
The version for mean instead of mode is A363943, high A363944.
A112798 lists prime indices, length A001222, sum A056239.
A326567/A326568 gives mean of prime indices.
A359178 ranks partitions with a unique co-mode, counted by A362610.
A356862 ranks partitions with a unique mode, counted by A362608.
A362605 ranks partitions with more than one mode, counted by A362607.
A362606 ranks partitions with more than one co-mode, counted by A362609.
A362611 counts modes in prime indices, triangle A362614.
A362613 counts co-modes in prime indices, triangle A362615.
A362616 ranks partitions (max part) = (unique mode), counted by A362612.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
    Table[If[n==1,0,First[modes[prix[n]]]],{n,30}]

A363727 Numbers whose prime indices satisfy (mean) = (median) = (mode), assuming there is a unique mode.

Original entry on oeis.org

2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23, 25, 27, 29, 31, 32, 37, 41, 43, 47, 49, 53, 59, 61, 64, 67, 71, 73, 79, 81, 83, 89, 90, 97, 101, 103, 107, 109, 113, 121, 125, 127, 128, 131, 137, 139, 149, 151, 157, 163, 167, 169, 173, 179, 181, 191, 193, 197, 199
Offset: 1

Views

Author

Gus Wiseman, Jun 23 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.
A mode in a multiset is an element that appears at least as many times as each of the others. For example, the modes in {a,a,b,b,b,c,d,d,d} are {b,d}.
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 terms together with their prime indices begin:
     2: {1}          29: {10}              79: {22}
     3: {2}          31: {11}              81: {2,2,2,2}
     4: {1,1}        32: {1,1,1,1,1}       83: {23}
     5: {3}          37: {12}              89: {24}
     7: {4}          41: {13}              90: {1,2,2,3}
     8: {1,1,1}      43: {14}              97: {25}
     9: {2,2}        47: {15}             101: {26}
    11: {5}          49: {4,4}            103: {27}
    13: {6}          53: {16}             107: {28}
    16: {1,1,1,1}    59: {17}             109: {29}
    17: {7}          61: {18}             113: {30}
    19: {8}          64: {1,1,1,1,1,1}    121: {5,5}
    23: {9}          67: {19}             125: {3,3,3}
    25: {3,3}        71: {20}             127: {31}
    27: {2,2,2}      73: {21}             128: {1,1,1,1,1,1,1}
		

Crossrefs

These partitions are counted by A363719, factorizations A363741.
For unequal instead of equal we have A363730, counted by A363720.
Excluding primes gives A363722.
Excluding prime-powers gives A363729, counted by A363728.
A112798 lists prime indices, length A001222, sum A056239.
A326567/A326568 gives mean of prime indices.
A356862 ranks partitions with a unique mode, counted by A362608.
A359178 ranks partitions with multiple modes, counted by A362610.
A360005 gives twice the median of prime indices.
A362611 counts modes in prime indices, triangle A362614.
A362613 counts co-modes in prime indices, triangle A362615.
A363486 gives least mode in prime indices, A363487 greatest.
Just two statistics:
- (mean) = (median): A359889, counted by A240219.
- (mean) != (median): A359890, counted by A359894.
- (mean) = (mode): counted by A363723, see A363724, A363731.
- (median) = (mode): counted by A363740.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
    Select[Range[100],{Mean[prix[#]]}=={Median[prix[#]]}==modes[prix[#]]&]

Formula

Assuming there is a unique mode, we have A326567(a(n))/A326568(a(n)) = A360005(a(n))/2 = A363486(a(n)) = A363487(a(n)).
Previous Showing 21-30 of 120 results. Next