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 31-40 of 196 results. Next

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.

A316428 Heinz numbers of integer partitions such that every part is divisible by the number of parts.

Original entry on oeis.org

1, 2, 3, 5, 7, 9, 11, 13, 17, 19, 21, 23, 29, 31, 37, 39, 41, 43, 47, 49, 53, 57, 59, 61, 67, 71, 73, 79, 83, 87, 89, 91, 97, 101, 103, 107, 109, 111, 113, 125, 127, 129, 131, 133, 137, 139, 149, 151, 157, 159, 163, 167, 169, 173, 179, 181, 183, 191, 193, 197
Offset: 1

Views

Author

Gus Wiseman, Jul 02 2018

Keywords

Comments

The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

Examples

			93499 is the Heinz number of (12,8,8,4) and belongs to the sequence because each part is divisible by 4.
Sequence of partitions such that every part is divisible by the number of parts begins (1), (2), (3), (4), (2,2), (5), (6), (7), (8), (4,2), (9).
		

Crossrefs

Programs

  • Mathematica
    Select[Range[200],And@@Cases[If[#==1,{},FactorInteger[#]],{p_,k_}:>Divisible[PrimePi[p],PrimeOmega[#]]]&]

A326623 Heinz numbers of integer partitions whose geometric mean is an integer.

Original entry on oeis.org

2, 3, 4, 5, 7, 8, 9, 11, 13, 14, 16, 17, 19, 23, 25, 27, 29, 31, 32, 37, 41, 42, 43, 46, 47, 49, 53, 57, 59, 61, 64, 67, 71, 73, 76, 79, 81, 83, 89, 97, 101, 103, 106, 107, 109, 113, 121, 125, 126, 127, 128, 131, 137, 139, 149, 151, 157, 161, 163, 167, 169
Offset: 1

Views

Author

Gus Wiseman, Jul 14 2019

Keywords

Comments

The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

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}
   11: {5}
   13: {6}
   14: {1,4}
   16: {1,1,1,1}
   17: {7}
   19: {8}
   23: {9}
   25: {3,3}
   27: {2,2,2}
   29: {10}
   31: {11}
   32: {1,1,1,1,1}
   37: {12}
		

Crossrefs

The enumeration of these partitions by sum is given by A067539.
Heinz numbers of partitions with integer average are A316413.
The case without prime powers is A326624.
Subsets whose geometric mean is an integer are A326027.
Factorizations with integer geometric mean are A326028.

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    Select[Range[100],IntegerQ[GeometricMean[primeMS[#]]]&]

A326669 Numbers k such that the average position of the ones in the binary expansion of k is an integer.

Original entry on oeis.org

1, 2, 4, 5, 7, 8, 10, 14, 16, 17, 20, 21, 27, 28, 31, 32, 34, 35, 39, 40, 42, 49, 54, 56, 57, 62, 64, 65, 68, 70, 73, 78, 80, 84, 85, 93, 98, 99, 107, 108, 112, 114, 119, 124, 127, 128, 130, 133, 136, 140, 141, 146, 147, 155, 156, 160, 161, 167, 168, 170, 175
Offset: 1

Views

Author

Gus Wiseman, Jul 17 2019

Keywords

Comments

These are numbers whose exponents in their representation as a sum of distinct powers of 2 have integer average.

Examples

			42 is in the sequence because 42 = 2^1 + 2^3 + 2^5 and the average of {1,3,5} is 3, an integer.
		

Crossrefs

Programs

  • Mathematica
    Select[Range[100],IntegerQ[Mean[Join@@Position[IntegerDigits[#,2],1]]]&]
  • PARI
    isok(m) = my(b=binary(m)); denominator(vecsum(Vec(select(x->(x==1), b, 1)))/hammingweight(m)) == 1; \\ Michel Marcus, Jul 02 2021

A326841 Heinz numbers of integer partitions of m >= 0 using divisors of m.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 11, 12, 13, 16, 17, 19, 23, 25, 27, 29, 30, 31, 32, 36, 37, 40, 41, 43, 47, 48, 49, 53, 59, 61, 63, 64, 67, 71, 73, 79, 81, 83, 84, 89, 97, 101, 103, 107, 108, 109, 112, 113, 121, 125, 127, 128, 131, 137, 139, 144, 149, 151, 157, 163
Offset: 1

Views

Author

Gus Wiseman, Jul 26 2019

Keywords

Comments

The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).
The enumeration of these partitions by sum is given by A018818.

Examples

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

Crossrefs

The case where the length also divides m is A326847.

Programs

  • Maple
    isA326841 := proc(n)
        local ifs,psigsu,p,psig ;
        psigsu := A056239(n) ;
        for ifs in ifactors(n)[2] do
            p := op(1,ifs) ;
            psig := numtheory[pi](p) ;
            if modp(psigsu,psig) <> 0 then
                return false;
            end if;
        end do:
        true;
    end proc:
    for i from 1 to 3000 do
        if isA326841(i) then
            printf("%d %d\n",n,i);
            n := n+1 ;
        end if;
    end do: # R. J. Mathar, Aug 09 2019
  • Mathematica
    Select[Range[100],With[{y=If[#==1,{},Flatten[Cases[FactorInteger[#],{p_,k_}:>Table[PrimePi[p],{k}]]]]},And@@IntegerQ/@(Total[y]/y)]&]

A360248 Numbers for which the prime indices do not have the same median as the distinct prime indices.

Original entry on oeis.org

12, 18, 20, 24, 28, 40, 44, 45, 48, 50, 52, 54, 56, 60, 63, 68, 72, 75, 76, 80, 84, 88, 92, 96, 98, 99, 104, 108, 112, 116, 117, 120, 124, 132, 135, 136, 140, 144, 147, 148, 150, 152, 153, 156, 160, 162, 164, 168, 171, 172, 175, 176, 184, 188, 189, 192, 200
Offset: 1

Views

Author

Gus Wiseman, Feb 07 2023

Keywords

Comments

First differs from A242416 in lacking 180, with prime indices {1,1,2,2,3}.
First differs from A360246 in lacking 126 and having 1950.
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}
  44: {1,1,5}
  45: {2,2,3}
  48: {1,1,1,1,2}
  50: {1,3,3}
  52: {1,1,6}
  54: {1,2,2,2}
  56: {1,1,1,4}
  60: {1,1,2,3}
  63: {2,2,4}
  68: {1,1,7}
  72: {1,1,1,2,2}
The prime indices of 126 are {1,2,2,4} with median 2 and distinct prime indices {1,2,4} with median 2, so 126 is not in the sequence.
The prime indices of 1950 are {1,2,3,3,6} with median 3 and distinct prime indices {1,2,3,6} with median 5/2, so 1950 is in the sequence.
		

Crossrefs

These partitions are counted by A360244.
The complement is A360249, counted by A360245.
For multiplicities instead of parts: complement of A360453.
For multiplicities instead of distinct parts: complement of A360454.
For mean instead of median we have A360246, counted by A360242.
The complement for mean instead of median is A360247, counted by A360243.
A112798 lists prime indices, length A001222, sum A056239.
A326567/A326568 gives mean of prime indices.
A326619/A326620 gives mean of distinct prime indices.
A325347 = partitions with integer median, strict A359907, ranked by A359908.
A359893 and A359901 count partitions by median.
A360005 gives median of prime indices (times two).

Programs

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

A363943 Mean of the multiset of prime indices of n, rounded down.

Original entry on oeis.org

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

Views

Author

Gus Wiseman, Jun 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.
Extending the terminology introduced at A124943, this is the "low mean" of prime indices.

Examples

			The prime indices of 360 are {1,1,1,2,2,3}, with mean 3/2, so a(360) = 1.
		

Crossrefs

Positions of first appearances are 1 and A000040.
Before rounding down we had A326567/A326568.
For mode instead of mean we have A363486, high A363487.
For low median instead of mean we have A363941, triangle A124943.
For high median instead of mean we have A363942, triangle A124944.
The high version is A363944, triangle A363946.
The triangle for this statistic (low mean) is A363945.
Positions of 1's are A363949(n) = 2*A344296(n), counted by A025065.
A088529/A088530 gives mean of prime signature A124010.
A112798 lists prime indices, length A001222, sum A056239.
A316413 ranks partitions with integer mean, counted by A067538.
A360005 gives twice the median of prime indices.
A363947 ranks partitions with rounded mean 1, counted by A363948.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    meandown[y_]:=If[Length[y]==0,0,Floor[Mean[y]]];
    Table[meandown[prix[n]],{n,100}]
Previous Showing 31-40 of 196 results. Next