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.

Showing 1-9 of 9 results.

A379721 Numbers whose prime indices have sum <= product.

Original entry on oeis.org

1, 2, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 30, 31, 33, 35, 37, 39, 41, 42, 43, 45, 47, 49, 50, 51, 53, 54, 55, 57, 59, 61, 63, 65, 66, 67, 69, 70, 71, 73, 75, 77, 78, 79, 81, 83, 84, 85, 87, 89, 90, 91, 93, 95, 97, 98, 99, 100, 101, 102, 103
Offset: 1

Views

Author

Gus Wiseman, Jan 05 2025

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.
Partitions of this type are counted by A319005.
The complement is A325038.

Examples

			The terms together with their prime indices begin:
    1: {}
    2: {1}
    3: {2}
    5: {3}
    7: {4}
    9: {2,2}
   11: {5}
   13: {6}
   15: {2,3}
   17: {7}
   19: {8}
   21: {2,4}
   23: {9}
   25: {3,3}
   27: {2,2,2}
   29: {10}
   30: {1,2,3}

Crossrefs

The case of equality is A301987, inequality A325037.
Nonpositive positions in A325036.
A000040 lists the primes, differences A001223.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A379681 gives sum plus product of prime indices, firsts A379682.
Counting and ranking multisets by comparing sum and product:
- same: A001055 (strict A045778), ranks A301987
- divisible: A057567, ranks A326155
- divisor: A057568, ranks A326149, see A326156, A326172, A379733
- greater: A096276 shifted right, ranks A325038
- greater or equal: A096276, ranks A325044
- less: A114324, ranks A325037, see A318029
- less or equal: A319005, ranks A379721 (this)
- different: A379736, ranks A379722, see A111133
Cf. A000720, A003963, A046022, A075254, A075255, A178503, A175508, A319000, A325034, A325035, A379720.

Programs

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

Formula

Number k such that A056239(k) <= A003963(k).

A379722 Numbers whose prime indices do not have the same sum as product.

Original entry on oeis.org

1, 4, 6, 8, 10, 12, 14, 15, 16, 18, 20, 21, 22, 24, 25, 26, 27, 28, 32, 33, 34, 35, 36, 38, 39, 40, 42, 44, 45, 46, 48, 49, 50, 51, 52, 54, 55, 56, 57, 58, 60, 62, 63, 64, 65, 66, 68, 69, 70, 72, 74, 75, 76, 77, 78, 80, 81, 82, 85, 86, 87, 88, 90, 91, 92, 93
Offset: 1

Views

Author

Gus Wiseman, Jan 08 2025

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.
Partitions of this type are counted by A379736.
The complement is A301987, counted by A001055.

Examples

			The terms together with their prime indices begin:
    1: {}
    4: {1,1}
    6: {1,2}
    8: {1,1,1}
   10: {1,3}
   12: {1,1,2}
   14: {1,4}
   15: {2,3}
   16: {1,1,1,1}
   18: {1,2,2}
   20: {1,1,3}
   21: {2,4}
   22: {1,5}
   24: {1,1,1,2}
   25: {3,3}
   26: {1,6}
   27: {2,2,2}
   28: {1,1,4}
   32: {1,1,1,1,1}

Crossrefs

Nonzeros of A325036.
A000040 lists the primes, differences A001223.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A324851 finds numbers > 1 divisible by the sum of their prime indices.
A379666 counts partitions by sum and product, without 1's A379668.
A379681 gives sum plus product of prime indices, firsts A379682.
Counting and ranking multisets by comparing sum and product:
- same: A001055 (strict A045778), ranks A301987
- divisible: A057567, ranks A326155
- divisor: A057568, ranks A326149, see A379733
- greater: A096276 shifted right, ranks A325038
- greater or equal: A096276, ranks A325044
- less: A114324, ranks A325037, see A318029
- less or equal: A319005, ranks A379721
- different: A379736, ranks A379722 (this)
Cf. A000720, A003963, A025147, A075254, A111133, A178503, A319000, A325041.

Programs

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

A075254 a(n) = n + (sum of prime factors of n taken with repetition).

Original entry on oeis.org

1, 4, 6, 8, 10, 11, 14, 14, 15, 17, 22, 19, 26, 23, 23, 24, 34, 26, 38, 29, 31, 35, 46, 33, 35, 41, 36, 39, 58, 40, 62, 42, 47, 53, 47, 46, 74, 59, 55, 51, 82, 54, 86, 59, 56, 71, 94, 59, 63, 62, 71, 69, 106, 65, 71, 69, 79, 89, 118, 72, 122, 95, 76, 76, 83, 82, 134, 89, 95, 84, 142
Offset: 1

Views

Author

Zak Seidov, Sep 10 2002

Keywords

Comments

a(n) = n + A001414(n).
Product of prime factors plus sum of prime factors of n. For minus instead of plus we have A075255, zeros A175787. - Gus Wiseman, Jan 26 2025

Examples

			a(6)=11 because 6=2*3, sopfr(6)=2+3=5 and 6+5=11.

Links

Crossrefs

A000027 gives product of prime factors, indices A003963.
A000040 lists the primes, differences A001223.
A001414 gives sum of prime factors, indices A056239.
A027746 lists prime factors, indices A112798, count A001222.
A075255 gives product of prime factors minus sum of prime factors.
Cf. A000720, A001055, A001222, A008472, A090340, A096461 (iteration), A175508, A319000, A325036, A325037, A325038, A379681, A379682.

Programs

  • Haskell
    a075254 n = n + a001414 n  -- Reinhard Zumkeller, Feb 27 2012
  • Magma
    [n eq 1 select 1 else (&+[p[1]*p[2]: p in Factorization(n)]) + n: n in [1..80]]; // G. C. Greubel, Jan 10 2019
  • Maple
    A075254 := proc(n)
    n+A001414(n) ;
end proc: # R. J. Mathar, Jul 27 2015
  • Mathematica
    Table[If[n==1,1, n +Plus@@Times@@@FactorInteger@n], {n, 80}] (* G. C. Greubel, Jan 10 2019 *)
  • PARI
    a(n) = my(f = factor(n)); n + sum(k=1, #f~, f[k,1]*f[k,2]); \\ Michel Marcus, Feb 22 2017
  • Sage
    [n + sum(factor(n)[j][0]*factor(n)[j][1] for j in range(0, len(factor(n)))) for n in range(1, 80)] # G. C. Greubel, Jan 10 2019

Formula

From Gus Wiseman, Jan 26 2025: (Start)
First differences are 1 - A090340(n).
a(n) = 2*n - A075255(n).
a(n) = 2*A001414(n) + A075255(n).
(End)

A379681 Sum plus product of the multiset of prime indices of n.

Original entry on oeis.org

1, 2, 4, 3, 6, 5, 8, 4, 8, 7, 10, 6, 12, 9, 11, 5, 14, 9, 16, 8, 14, 11, 18, 7, 15, 13, 14, 10, 20, 12, 22, 6, 17, 15, 19, 10, 24, 17, 20, 9, 26, 15, 28, 12, 19, 19, 30, 8, 24, 16, 23, 14, 32, 15, 23, 11, 26, 21, 34, 13, 36, 23, 24, 7, 27, 18, 38, 16, 29, 20
Offset: 1

Views

Author

Gus Wiseman, Jan 05 2025

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.
Includes all positive integers.

Crossrefs

For prime factors instead of indices we have A075254, subtracted A075255.
Positions of first appearances are A379682.
For minus instead of plus we have A325036, which takes the following values:
- zero: A301987, counted by A001055
- negative: A325037, counted by A114324
- positive: A325038, counted by A096276 shifted right
- negative one: A325041, counted by A028422
- one: A325042, counted by A001055 shifted right
- nonnegative: A325044, counted by A096276
- nonpositive: A379721, counted by A319005
A000040 lists the primes, differences A001223.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
Cf. A000720, A003963, A178503, A175508, A319000, A325032, A325033, A325034, A325035, A325040.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Plus@@prix[n]+Times@@prix[n],{n,30}]

Formula

a(n) = A056239(n) + A003963(n).
The last position of k is 2^(k-1).

A380344 Product of prime indices minus sum of prime factors of n.

Original entry on oeis.org

1, -1, -1, -3, -2, -3, -3, -5, -2, -4, -6, -5, -7, -5, -2, -7, -10, -4, -11, -6, -2, -8, -14, -7, -1, -9, -1, -7, -19, -4, -20, -9, -4, -12, 0, -6, -25, -13, -4, -8, -28, -4, -29, -10, 1, -16, -32, -9, 2, -3, -6, -11, -37, -3, -1, -9, -6, -21, -42, -6, -43
Offset: 1

Views

Author

Gus Wiseman, Jan 24 2025

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, with product A003963.

Examples

			72 has prime factors {2,2,2,3,3} and prime indices {1,1,1,2,2}, so a(72) = 4 - 12 = -8.

Crossrefs

Positions of 0 are A331384.
For plus instead of minus we have A380409.
Positions of positives are A380410.
Triangles:
- A027746 = prime factors
- A112798 = prime indices
Statistics:
- A000027 = product of prime factors = row products of A027746
- A001414 = sum of prime factors = row sums of A027746
- A003963 = product of prime indices = row products of A112798
- A056239 = sum of prime indices = row sums of A112798
Combinations:
- A075254 = product of factors + sum of factors = A000027 + A001414
- A075255 = product of factors - sum of factors = A000027 - A001414
- A178503 = product of factors - sum of indices = A000027 - A056239
- A325036 = product of indices - sum of indices = A003963 - A056239
- A379681 = product of indices + sum of indices = A003963 + A056239
- A380344 = product of indices - sum of factors = A003963 - A001414
- A380345 = product of factors + sum of indices = A000027 + A056239
- A380409 = product of indices + sum of factors = A003963 + A001414
A000040 lists the primes, differences A001223.
A001222 counts prime factors with multiplicity.
A055396 gives least prime index, greatest A061395.
Cf. A000720, A175508, A319000, A325032, A325033, A325034, A325035, A325040, A379682, A380220.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Times@@prix[n]-Plus@@Prime/@prix[n],{n,100}]

Formula

a(n) = A003963(n) - A001414(n).

A380220 Least positive integer whose prime indices satisfy (product) - (sum) = n. Position of first appearance of n in A325036.

Original entry on oeis.org

2, 1, 21, 25, 39, 35, 57, 55, 49, 65, 75, 77, 129, 95, 91, 105, 183, 119, 125, 143, 133, 185, 147, 161, 169, 195, 175, 209, 339, 217, 255, 253, 259, 305, 247, 285, 273, 245, 301, 299, 345, 323, 325, 357, 371, 435, 669, 391, 361, 403, 399, 473, 343, 469, 481
Offset: 0

Views

Author

Gus Wiseman, Jan 21 2025

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 sum and product of prime indices are A056239 and A003963 respectively.

Examples

			The least number whose prime indices satisfy (product) - (sum) = 3 is 25 (prime indices {3,3}), so a(3) = 25.

Crossrefs

Position of first appearance of n in A325036.
For sum instead of difference we have A379682, firsts of A379681.
A000040 lists the primes, differences A001223.
A003963 multiplies together prime indices.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798.
The subtraction A325036 takes the following values:
- zero: A301987, counted by A001055 (strict A045778).
- negative: A325037, counted by A114324, see A318029
- positive: A325038, counted by A096276 shifted right
- negative one: A325041, counted by A028422
- one: A325042, counted by A001055 shifted right
- nonnegative: A325044, counted by A096276
- nonpositive: A379721, counted by A319005
Cf. A000720, A178503, A175508, A318950, A319000, A325034, A326151, A326153/A326154, A379319, A379722.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
pp=Table[Total[prix[n]]-Times@@prix[n],{n,100}];
mnrm[s_]:=If[Min@@s==1,mnrm[DeleteCases[s-1,0]]+1,0];
Table[Position[pp,-i][[1,1]],{i,0,mnrm[-DeleteCases[pp,0|_?Positive]]}]

Formula

Satisfies A003963(a(n)) - A056239(a(n)) = n.

A380345 a(n) = n + sum of prime indices of n.

Original entry on oeis.org

1, 3, 5, 6, 8, 9, 11, 11, 13, 14, 16, 16, 19, 19, 20, 20, 24, 23, 27, 25, 27, 28, 32, 29, 31, 33, 33, 34, 39, 36, 42, 37, 40, 42, 42, 42, 49, 47, 47, 46, 54, 49, 57, 51, 52, 56, 62, 54, 57, 57, 60, 60, 69, 61, 63, 63, 67, 69, 76, 67, 79, 74, 71, 70, 74, 74, 86
Offset: 1

Views

Author

Gus Wiseman, Jan 25 2025

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, with sum A056239.

Examples

			72 has prime indices {1,1,1,2,2}, so a(72) = 72 + 7 = 79.

Crossrefs

For factors instead of indices we have A075254.
For minus instead of plus we have A178503.
Triangles:
- A027746 = prime factors
- A112798 = prime indices
Statistics:
- A000027 = product of prime factors = row products of A027746
- A001414 = sum of prime factors = row sums of A027746
- A003963 = product of prime indices = row products of A112798
- A056239 = sum of prime indices = row sums of A112798
Combinations:
- A075254 = product of factors + sum of factors = A000027 + A001414
- A075255 = product of factors - sum of factors = A000027 - A001414
- A178503 = product of factors - sum of indices = A000027 - A056239
- A325036 = product of indices - sum of indices = A003963 - A056239
- A379681 = product of indices + sum of indices = A003963 + A056239
- A380344 = product of indices - sum of factors = A003963 - A001414
- A380345 = product of factors + sum of indices = A000027 + A056239
- A380409 = product of indices + sum of factors = A003963 + A001414
A000040 lists the primes, differences A001223.
A001222 counts prime factors with multiplicity.
A055396 gives least prime index, greatest A061395.
Cf. A000720, A175508, A319000, A325032, A325033, A325034, A325035, A325040, A331384, A379682, A380220.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[n+Total[prix[n]],{n,100}]

Formula

a(n) = n + A056239(n).

A380409 Product of prime indices plus sum of prime factors.

Original entry on oeis.org

1, 3, 5, 5, 8, 7, 11, 7, 10, 10, 16, 9, 19, 13, 14, 9, 24, 12, 27, 12, 18, 18, 32, 11, 19, 21, 17, 15, 39, 16, 42, 11, 24, 26, 24, 14, 49, 29, 28, 14, 54, 20, 57, 20, 23, 34, 62, 13, 30, 21, 34, 23, 69, 19, 31, 17, 38, 41, 76, 18, 79, 44, 29, 13, 36, 26, 86
Offset: 1

Views

Author

Gus Wiseman, Jan 25 2025

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, with product A003963.

Examples

			72 has prime factors {2,2,2,3,3} and prime indices {1,1,1,2,2}, so a(72) = 12 + 4 = 16.

Crossrefs

For factors instead of indices we have A075254.
For indices instead of factors we have A379681.
For minus instead of plus we have A380344, zeros A331384.
Triangles:
- A027746 = prime factors
- A112798 = prime indices
Statistics:
- A000027 = product of prime factors = row products of A027746
- A001414 = sum of prime factors = row sums of A027746
- A003963 = product of prime indices = row products of A112798
- A056239 = sum of prime indices = row sums of A112798
Combinations:
- A075254 = product of factors + sum of factors = A000027 + A001414
- A075255 = product of factors - sum of factors = A000027 - A001414
- A178503 = product of factors - sum of indices = A000027 - A056239
- A325036 = product of indices - sum of indices = A003963 - A056239
- A379681 = product of indices + sum of indices = A003963 + A056239
- A380344 = product of indices - sum of factors = A003963 - A001414
- A380345 = product of factors + sum of indices = A000027 + A056239
- A380409 = product of indices + sum of factors = A003963 + A001414
A000040 lists the primes, differences A001223.
A001222 counts prime factors with multiplicity.
A055396 gives least prime index, greatest A061395.
Cf. A000720, A175508, A319000, A325032, A325033, A325034, A325035, A325040, A379682, A380220, A380410.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Total[Prime/@prix[n]]+Times@@prix[n],{n,100}]

Formula

a(n) = A003963(n) + A001414(n).

A380410 Numbers with greater product of prime indices than sum of prime factors.

Original entry on oeis.org

1, 45, 49, 63, 75, 77, 81, 91, 99, 105, 117, 119, 121, 125, 126, 133, 135, 143, 147, 150, 153, 161, 162, 165, 169, 171, 175, 182, 187, 189, 195, 198, 203, 207, 209, 210, 217, 221, 225, 231, 234, 238, 242, 243, 245, 247, 250, 253, 255, 259, 261, 266, 270, 273
Offset: 1

Views

Author

Gus Wiseman, Jan 25 2025

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, with product A003963.

Examples

			126 has prime indices {1,2,2,4} and prime factors {2,3,3,7}, and 16 > 15, so 126 is in the sequence.
The terms together with their prime indices begin:
     1: {}
    45: {2,2,3}
    49: {4,4}
    63: {2,2,4}
    75: {2,3,3}
    77: {4,5}
    81: {2,2,2,2}
    91: {4,6}
    99: {2,2,5}
   105: {2,3,4}
   117: {2,2,6}
   119: {4,7}
   121: {5,5}
   125: {3,3,3}
   126: {1,2,2,4}
   133: {4,8}
   135: {2,2,2,3}

Crossrefs

For factors instead of indices we have A002808.
The case of prime powers is A244623.
For indices instead of factors we have A325037, see also A325038.
The version for equality is A331384, counted by A331383.
Positions of positive terms in A380344.
Partitions of this type are counted by A380411.
A000040 lists the primes, differences A001223.
A001222 counts prime factors with multiplicity.
A055396 gives least prime index, greatest A061395.
Triangles:
- A027746 = prime factors
- A112798 = prime indices
Statistics:
- A000027 = product of prime factors = row products of A027746
- A001414 = sum of prime factors = row sums of A027746
- A003963 = product of prime indices = row products of A112798
- A056239 = sum of prime indices = row sums of A112798
Combinations:
- A075254 = product of factors + sum of factors = A000027 + A001414
- A075255 = product of factors - sum of factors = A000027 - A001414
- A178503 = product of factors - sum of indices = A000027 - A056239
- A325036 = product of indices - sum of indices = A003963 - A056239
- A379681 = product of indices + sum of indices = A003963 + A056239
- A380344 = product of indices - sum of factors = A003963 - A001414
- A380345 = product of factors + sum of indices = A000027 + A056239
- A380409 = product of indices + sum of factors = A003963 + A001414
Cf. A000720, A175508, A301987, A319000, A325040, A325041, A325044, A379682, A380220.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],Times@@prix[#]>Plus@@Prime/@prix[#]&]

Formula

A003963(a(n)) > A001414(a(n)).
Showing 1-9 of 9 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.