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-18 of 18 results.

A344413 Numbers n whose sum of prime indices A056239(n) is even and is at least twice the number of prime factors A001222(n).

Original entry on oeis.org

1, 3, 7, 9, 10, 13, 19, 21, 22, 25, 27, 28, 29, 30, 34, 37, 39, 43, 46, 49, 52, 53, 55, 57, 61, 62, 63, 66, 70, 71, 75, 76, 79, 81, 82, 84, 85, 87, 88, 89, 90, 91, 94, 100, 101, 102, 107, 111, 113, 115, 116, 117, 118, 121, 129, 130, 131, 133, 134, 136, 138
Offset: 1

Views

Author

Gus Wiseman, May 19 2021

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.
Also Heinz numbers of integer partitions of even numbers m with at most m/2 parts, counted by A209816 riffled with zeros, or A110618 with odd positions zeroed out.

Examples

			The sequence of terms together with their prime indices begins:
      1: {}          37: {12}        75: {2,3,3}
      3: {2}         39: {2,6}       76: {1,1,8}
      7: {4}         43: {14}        79: {22}
      9: {2,2}       46: {1,9}       81: {2,2,2,2}
     10: {1,3}       49: {4,4}       82: {1,13}
     13: {6}         52: {1,1,6}     84: {1,1,2,4}
     19: {8}         53: {16}        85: {3,7}
     21: {2,4}       55: {3,5}       87: {2,10}
     22: {1,5}       57: {2,8}       88: {1,1,1,5}
     25: {3,3}       61: {18}        89: {24}
     27: {2,2,2}     62: {1,11}      90: {1,2,2,3}
     28: {1,1,4}     63: {2,2,4}     91: {4,6}
     29: {10}        66: {1,2,5}     94: {1,15}
     30: {1,2,3}     70: {1,3,4}    100: {1,1,3,3}
     34: {1,7}       71: {20}       101: {26}
For example, 75 has 3 prime indices {2,3,3} with sum 8 >= 2*3, so 75 is in the sequence.

Links

Crossrefs

These are the Heinz numbers of partitions counted by A209816 and A110618.
A subset of A300061 (sum of prime indices is even).
The conjugate version appears to be A320924 (allowing odd weights: A322109).
The case of equality is A340387.
Allowing odd weights gives A344291.
The 5-smooth case is A344295, or A344293 allowing odd weights.
The opposite version allowing odd weights is A344296.
The conjugate opposite version allowing odd weights is A344414.
The case of equality in the conjugate case is A344415.
The conjugate opposite version is A344416, counted by A000070.
A001222 counts prime factors with multiplicity.
A027187 counts partitions of even length, ranked by A028260.
A056239 adds up prime indices, row sums of A112798.
A058696 counts partitions of even numbers, ranked by A300061.
A301987 lists numbers whose sum of prime indices equals their product.
A330950 counts partitions of n with Heinz number divisible by n.
A334201 adds up all prime indices except the greatest.
Cf. A001414, A025065, A067538, A301988, A316413, A316428, A325037, A325038, A325044, A338914, A344294, A344297.

Programs

  • Maple
    filter:= proc(n) local F,a,t;
  F:= ifactors(n)[2];
  a:= add((numtheory:-pi(t[1])-2)*t[2],t=F);
  a::even and a >= 0
end proc:
select(filter, [$1..300]); # Robert Israel, Oct 10 2024
  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],EvenQ[Total[primeMS[#]]]&&PrimeOmega[#]<=Total[primeMS[#]]/2&]

Formula

Members m of A300061 such that A056239(m) >= 2*A001222(m).

A366319 Numbers k such that the sum of prime indices of k is not twice the maximum prime index of k, meaning A056239(k) != 2 * A061395(k).

Original entry on oeis.org

1, 2, 3, 5, 6, 7, 8, 10, 11, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 26, 27, 28, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 64, 65, 66, 67, 68, 69, 71, 72, 73, 74, 75, 76
Offset: 1

Views

Author

Gus Wiseman, Oct 10 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.
Also Heinz numbers of integer partitions containing n/2, where n is the sum of all parts.

Examples

			The prime indices of 90 are {1,2,2,3}, with sum 8 and twice maximum 6, so 90 is in the sequence.

Crossrefs

Partitions of this type are counted by A086543.
For length instead of maximum we have the complement of A340387.
The complement is A344415, counted by A035363.
A001221 counts distinct prime factors, A001222 with multiplicity.
A056239 adds up prime indices, row sums of A112798.
A334201 adds up all prime indices except the greatest.
A344291 lists numbers m with A001222(m) <= A056239(m)/2, counted by A110618.
A344296 lists numbers m with A001222(m) >= A056239(m)/2, counted by A025065.
Cf. A001414, A100959, A238628, A300061, A301987, A316413, A320924, A344414, A344416, A366318.

Programs

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

A339896 a(n) = A056239(n) - A339894(n).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Dec 21 2020

Keywords

Links

Crossrefs

Cf. A000523, A056239, A122111, A334201, A339823, A339894, A339895.

Programs

  • PARI
    A000523(n) = if( n<1, 0, #binary(n) - 1); \\ From A000523
A122111(n) = if(1==n,n,my(f=factor(n), es=Vecrev(f[,2]),is=concat(apply(primepi,Vecrev(f[,1])),[0]),pri=0,m=1); for(i=1, #es, pri += es[i]; m *= prime(pri)^(is[i]-is[1+i])); (m));
A056239(n) = { my(f); if(1==n, 0, f=factor(n); sum(i=1, #f~, f[i,2] * primepi(f[i,1]))); }
A339896(n) = (A056239(n)-A000523(A122111(n)));

Formula

a(n) = A056239(n) - A339894(n).
a(n) = A334201(n) - A339895(n).
a(n) = A339823(A122111(n)).

A360669 Nonprime numbers > 1 for which the prime indices have the same mean as their first differences.

Original entry on oeis.org

10, 39, 68, 115, 138, 259, 310, 328, 387, 517, 574, 636, 793, 795, 1034, 1168, 1206, 1241, 1281, 1340, 1534, 1691, 1825, 2212, 2278, 2328, 2343, 2369, 2370, 2727, 2774, 2905, 3081, 3277, 3818, 3924, 4064, 4074, 4247, 4268, 4360, 4539, 4850, 4905, 5243, 5335
Offset: 1

Views

Author

Gus Wiseman, Feb 18 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:
     1: {}
    10: {1,3}
    39: {2,6}
    68: {1,1,7}
   115: {3,9}
   138: {1,2,9}
   259: {4,12}
   310: {1,3,11}
   328: {1,1,1,13}
   387: {2,2,14}
   517: {5,15}
   574: {1,4,13}
   636: {1,1,2,16}
For example, the prime indices of 138 are {1,2,9}, with mean 4, and with first differences (1,7), with mean also 4, so 138 is in the sequence.

Crossrefs

These partitions are counted by A360670.
A058398 counts partitions by mean, see also A008284, A327482.
A112798 = prime indices, length A001222, sum A056239, mean A326567/A326568.
A124010 gives prime signature, mean A088529/A088530.
A301987 lists numbers whose sum of prime indices equals their product.
A316413 lists numbers whose prime indices have integer mean.
A334201 adds up all prime indices except the greatest.
A360614/A360615 = mean of first differences of 0-prepended prime indices.
Cf. A340610, A344415, A348551, A359904, A360008, A360068, A360681.

Programs

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

A344292 Numbers m whose sum of prime indices A056239(m) is even and is at most twice the number of prime factors counted with multiplicity A001222(m).

Original entry on oeis.org

1, 3, 4, 9, 10, 12, 16, 27, 28, 30, 36, 40, 48, 64, 81, 84, 88, 90, 100, 108, 112, 120, 144, 160, 192, 208, 243, 252, 256, 264, 270, 280, 300, 324, 336, 352, 360, 400, 432, 448, 480, 544, 576, 624, 640, 729, 756, 768, 784, 792, 810, 832, 840, 880, 900, 972
Offset: 1

Views

Author

Gus Wiseman, May 22 2021

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.
Also Heinz numbers of integer partitions of even numbers m with at least m/2 parts, counted by A000070 riffled with 0's, or A025065 with odd positions zeroed out.

Examples

			The sequence of terms together with their prime indices begins:
       1: {}                 84: {1,1,2,4}
       3: {2}                88: {1,1,1,5}
       4: {1,1}              90: {1,2,2,3}
       9: {2,2}             100: {1,1,3,3}
      10: {1,3}             108: {1,1,2,2,2}
      12: {1,1,2}           112: {1,1,1,1,4}
      16: {1,1,1,1}         120: {1,1,1,2,3}
      27: {2,2,2}           144: {1,1,1,1,2,2}
      28: {1,1,4}           160: {1,1,1,1,1,3}
      30: {1,2,3}           192: {1,1,1,1,1,1,2}
      36: {1,1,2,2}         208: {1,1,1,1,6}
      40: {1,1,1,3}         243: {2,2,2,2,2}
      48: {1,1,1,1,2}       252: {1,1,2,2,4}
      64: {1,1,1,1,1,1}     256: {1,1,1,1,1,1,1,1}
      81: {2,2,2,2}         264: {1,1,1,2,5}

Crossrefs

These are the Heinz numbers of partitions counted by A000070 and A025065.
A subset of A300061 (sum of prime indices is even).
The conjugate opposite version is A320924, counted by A209816.
The conjugate opposite version allowing odds is A322109, counted by A110618.
The case of equality is A340387, counted by A000041.
The opposite version allowing odd weights is A344291, counted by A110618.
Allowing odd weights gives A344296, counted by A025065.
The opposite version is A344413, counted by A209816.
The conjugate version allowing odd weights is A344414, counted by A025065.
The case of equality in the conjugate case is A344415, counted by A035363.
The conjugate version is A344416, counted by A000070.
A001222 counts prime factors with multiplicity.
A027187 counts partitions of even length, ranked by A028260.
A056239 adds up prime indices, row sums of A112798.
A058696 counts partitions of even numbers, ranked by A300061.
A301987 lists numbers whose sum of prime indices equals their product.
A330950 counts partitions of n with Heinz number divisible by n.
A334201 adds up all prime indices except the greatest.
Cf. A001414, A067538, A316413, A316428, A325037, A325038, A325044, A338914, A344294, A344297.

Programs

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

Formula

Members m of A300061 such that A056239(m) <= 2*A001222(m).

A366318 Heinz numbers of integer partitions that are of length 2 or begin with n/2, where n is the sum of all parts.

Original entry on oeis.org

4, 6, 9, 10, 12, 14, 15, 21, 22, 25, 26, 30, 33, 34, 35, 38, 39, 40, 46, 49, 51, 55, 57, 58, 62, 63, 65, 69, 70, 74, 77, 82, 84, 85, 86, 87, 91, 93, 94, 95, 106, 111, 112, 115, 118, 119, 121, 122, 123, 129, 133, 134, 141, 142, 143, 145, 146, 154, 155, 158, 159
Offset: 1

Views

Author

Gus Wiseman, Oct 08 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:
     4: {1,1}      38: {1,8}         77: {4,5}
     6: {1,2}      39: {2,6}         82: {1,13}
     9: {2,2}      40: {1,1,1,3}     84: {1,1,2,4}
    10: {1,3}      46: {1,9}         85: {3,7}
    12: {1,1,2}    49: {4,4}         86: {1,14}
    14: {1,4}      51: {2,7}         87: {2,10}
    15: {2,3}      55: {3,5}         91: {4,6}
    21: {2,4}      57: {2,8}         93: {2,11}
    22: {1,5}      58: {1,10}        94: {1,15}
    25: {3,3}      62: {1,11}        95: {3,8}
    26: {1,6}      63: {2,2,4}      106: {1,16}
    30: {1,2,3}    65: {3,6}        111: {2,12}
    33: {2,5}      69: {2,9}        112: {1,1,1,1,4}
    34: {1,7}      70: {1,3,4}      115: {3,9}
    35: {3,4}      74: {1,12}       118: {1,17}

Crossrefs

The first condition alone is A001358, counted by A004526.
The complement of the first condition is A100959, counted by A058984.
The partitions with these Heinz numbers are counted by A238628.
The second condition alone is A344415, counted by A035363.
The complement of the second condition is A366319, counted by A086543.
A001222 counts prime factors with multiplicity.
A056239 adds up prime indices, row sums of A112798.
A322109 ranks partitions of n with no part > n/2, counted by A110618.
A334201 adds up all prime indices except the greatest.
A344296 solves for k in A001222(k) >= A056239(k)/2, counted by A025065.
Cf. A001414, A316413, A320924, A325044, A340387, A344414, A344416.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],Length[prix[#]]==2||MemberQ[prix[#],Total[prix[#]]/2]&]

Formula

Union of A001358 and A344415.

A360668 Numbers > 1 whose greatest prime index is not divisible by their number of prime factors (bigomega).

Original entry on oeis.org

4, 8, 10, 12, 15, 16, 18, 22, 24, 25, 27, 28, 32, 33, 34, 36, 40, 42, 44, 46, 48, 51, 54, 55, 60, 62, 63, 64, 66, 68, 69, 70, 72, 76, 77, 80, 81, 82, 85, 88, 90, 93, 94, 96, 98, 99, 100, 102, 104, 105, 108, 110, 112, 114, 115, 116, 118, 119, 120, 121, 123, 124
Offset: 1

Views

Author

Gus Wiseman, Feb 17 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.
Also numbers > 1 whose first differences of 0-prepended prime indices have non-integer mean.

Examples

			The prime indices of 1617 are {2,4,4,5}, and 5 is not divisible by 4, so 1617 is in the sequence.

Crossrefs

These partitions are counted by A200727.
The complement is A340610 (without 1), counted by A168659.
For median instead of mean we have A360557, counted by A360691.
Positions of terms > 1 in A360615 (numerator: A360614).
A058398 counts partitions by mean, see also A008284, A327482.
A067340 lists numbers whose prime signature has integer mean.
A112798 = prime indices, length A001222, sum A056239, mean A326567/A326568.
A334201 adds up all prime indices except the greatest.
A348551 = numbers w/ non-integer mean of prime indices, complement A316413.
Cf. A072978, A078175, A139710, A307683, A359912, A360551, A360554, A360556, A360669.

Programs

  • Mathematica
    Select[Range[2,100],!Divisible[PrimePi[FactorInteger[#][[-1,1]]],PrimeOmega[#]]&]

A363261 The partial sums of the prime indices of n include half the sum of all prime indices of n.

Original entry on oeis.org

4, 9, 12, 16, 25, 30, 40, 48, 49, 63, 64, 70, 81, 84, 108, 112, 121, 144, 154, 160, 165, 169, 192, 198, 220, 256, 264, 270, 273, 286, 289, 325, 351, 352, 360, 361, 364, 390, 442, 448, 468, 480, 520, 529, 561, 567, 576, 595, 624, 625, 640, 646, 675, 714, 729
Offset: 1

Views

Author

Gus Wiseman, Jun 06 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:
   4: {1,1}
   9: {2,2}
  12: {1,1,2}
  16: {1,1,1,1}
  25: {3,3}
  30: {1,2,3}
  40: {1,1,1,3}
  48: {1,1,1,1,2}
  49: {4,4}
  63: {2,2,4}
  64: {1,1,1,1,1,1}
  70: {1,3,4}
  81: {2,2,2,2}
  84: {1,1,2,4}

Crossrefs

Partitions of this type are counted by A322439.
For parts instead of partial sums we have A344415, counted by A035363.
A025065 counts palindromic partitions, ranked by A265640.
A027746 lists prime factors, A112798 indices, length A001222, sum A056239.
A301987 lists numbers whose sum of prime indices equals their product.
A322109 ranks partitions of n with no part > n/2, counted by A110618.
Cf. A001414, A106529, A327473, A327476, A334201, A340387, A360005.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],MemberQ[Accumulate[prix[#]],Total[prix[#]]/2]&]
Previous Showing 11-18 of 18 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.