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

A379302 Number of integer partitions of n with a unique composite part.

Original entry on oeis.org

0, 0, 0, 0, 1, 1, 3, 4, 7, 11, 16, 23, 32, 43, 58, 77, 100, 129, 164, 207, 259, 323, 398, 489, 595, 723, 872, 1049, 1255, 1495, 1774, 2097, 2472, 2903, 3399, 3969, 4618, 5362, 6210, 7173, 8268, 9506, 10907, 12488, 14271, 16278, 18532, 21061, 23893, 27064
Offset: 0

Views

Author

Gus Wiseman, Dec 25 2024

Keywords

Examples

			The a(0) = 0 through a(9) = 11 partitions:
  .  .  .  .  (4)  (41)  (6)    (43)    (8)      (9)
                         (42)   (61)    (62)     (54)
                         (411)  (421)   (422)    (63)
                                (4111)  (431)    (81)
                                        (611)    (432)
                                        (4211)   (621)
                                        (41111)  (4221)
                                                 (4311)
                                                 (6111)
                                                 (42111)
                                                 (411111)
		

Crossrefs

If all parts are composite we have A023895 (strict A204389), ranks A320629.
If no parts are composite we have A034891 (strict A036497), ranks A302540.
Ranked by A379301 = positions of 1 in A379300.
The strict case is A379303.
For a unique prime part we have A379304 (strict A379305), ranks A331915.
A000041 counts integer partitions, strict A000009.
A002808 lists the composite numbers, nonprimes A018252.
A066247 is the characteristic function for the composite numbers.
A377033 gives k-th differences of composite numbers.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],Count[#,_?CompositeQ]==1&]],{n,0,30}]

A379307 Positive integers whose prime indices include no squarefree numbers.

Original entry on oeis.org

1, 7, 19, 23, 37, 49, 53, 61, 71, 89, 97, 103, 107, 131, 133, 151, 161, 173, 193, 197, 223, 227, 229, 239, 251, 259, 263, 281, 307, 311, 337, 343, 359, 361, 371, 379, 383, 409, 419, 427, 433, 437, 457, 463, 479, 497, 503, 521, 523, 529, 541, 569, 593, 613, 623
Offset: 1

Views

Author

Gus Wiseman, Dec 27 2024

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: {}
    7: {4}
   19: {8}
   23: {9}
   37: {12}
   49: {4,4}
   53: {16}
   61: {18}
   71: {20}
   89: {24}
   97: {25}
  103: {27}
  107: {28}
  131: {32}
  133: {4,8}
  151: {36}
  161: {4,9}
  173: {40}
		

Crossrefs

Partitions of this type are counted by A114374, strict A256012.
Positions of zero in A379306.
For a unique squarefree part we have A379316, counted by A379308 (strict A379309).
A000040 lists the primes, differences A001223.
A005117 lists the squarefree numbers, differences A076259.
A008966 is the characteristic function for the squarefree numbers.
A013929 lists the nonsquarefree numbers, differences A078147.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A061398 counts squarefree numbers between primes, zeros A068360.
A377038 gives k-th differences of squarefree numbers.
Other counts of prime indices:
- A330944 nonprime, see A000586, A000607, A076610, A330945.
- A379310 nonsquarefree, see A302478.
- A379311 old prime, see A204389, A320629, A379312-A379315.

Programs

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

A379310 Number of nonsquarefree prime indices of n.

Original entry on oeis.org

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

Views

Author

Gus Wiseman, Dec 27 2024

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 prime indices of 39 are {2,6}, so a(39) = 0.
The prime indices of 70 are {1,3,4}, so a(70) = 1.
The prime indices of 98 are {1,4,4}, so a(98) = 2.
The prime indices of 294 are {1,2,4,4}, a(294) = 2.
The prime indices of 1911 are {2,4,4,6}, so a(1911) = 2.
The prime indices of 2548 are {1,1,4,4,6}, so a(2548) = 2.
		

Crossrefs

Positions of first appearances are A000420.
Positions of zero are A302478, counted by A073576 (strict A087188).
No squarefree parts: A379307, counted by A114374 (strict A256012).
One squarefree part: A379316, counted by A379308 (strict A379309).
A000040 lists the primes, differences A001223.
A005117 lists the squarefree numbers, differences A076259.
A008966 is the characteristic function for the squarefree numbers.
A013929 lists the nonsquarefree numbers, differences A078147.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A061398 counts squarefree numbers between primes, zeros A068360.
A377038 gives k-th differences of squarefree numbers.
Other counts of prime indices:
- A330944 nonprime, see A000586, A000607, A076610, A330945.
- A379311 old prime, see A204389, A320629, A379312-A379315.

Programs

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

Formula

Totally additive with a(prime(k)) = A107078(k) = 1 - A008966(k).

A379303 Number of strict integer partitions of n with a unique composite part.

Original entry on oeis.org

0, 0, 0, 0, 1, 1, 2, 3, 3, 6, 6, 8, 10, 10, 13, 15, 17, 20, 22, 24, 28, 31, 36, 40, 44, 50, 55, 62, 70, 75, 83, 89, 97, 108, 115, 128, 136, 146, 161, 172, 188, 203, 215, 233, 249, 269, 291, 309, 331, 353, 376, 405, 433, 459, 490, 518, 554, 592, 629, 670, 705
Offset: 0

Views

Author

Gus Wiseman, Dec 25 2024

Keywords

Examples

			The a(4) = 1 through a(11) = 8 partitions:
  (4)  (4,1)  (6)    (4,3)    (8)      (9)      (10)       (6,5)
              (4,2)  (6,1)    (6,2)    (5,4)    (8,2)      (7,4)
                     (4,2,1)  (4,3,1)  (6,3)    (9,1)      (8,3)
                                       (8,1)    (5,4,1)    (9,2)
                                       (4,3,2)  (6,3,1)    (10,1)
                                       (6,2,1)  (4,3,2,1)  (5,4,2)
                                                           (6,3,2)
                                                           (8,2,1)
		

Crossrefs

If no parts are composite we have A036497, non-strict A034891 (ranks A302540).
If all parts are composite we have A204389, non-strict A023895 (ranks A320629).
The non-strict version is A379302, ranks A379301 (positions of 1 in A379300).
For a unique prime we have A379305, non-strict A379304 (ranks A331915).
A000040 lists the prime numbers, differences A001223.
A000041 counts integer partitions, strict A000009.
A002808 lists the composite numbers, nonprimes A018252.
A066247 is the characteristic function for the composite numbers.
A377033 gives k-th differences of composite numbers, see A073445, A377034-A377037.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&Count[#,_?CompositeQ]==1&]],{n,0,30}]

A379306 Number of squarefree prime indices of n.

Original entry on oeis.org

0, 1, 1, 2, 1, 2, 0, 3, 2, 2, 1, 3, 1, 1, 2, 4, 1, 3, 0, 3, 1, 2, 0, 4, 2, 2, 3, 2, 1, 3, 1, 5, 2, 2, 1, 4, 0, 1, 2, 4, 1, 2, 1, 3, 3, 1, 1, 5, 0, 3, 2, 3, 0, 4, 2, 3, 1, 2, 1, 4, 0, 2, 2, 6, 2, 3, 1, 3, 1, 2, 0, 5, 1, 1, 3, 2, 1, 3, 1, 5, 4, 2, 1, 3, 2, 2, 2
Offset: 1

Views

Author

Gus Wiseman, Dec 25 2024

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 prime indices of 39 are {2,6}, so a(39) = 2.
The prime indices of 70 are {1,3,4}, so a(70) = 2.
The prime indices of 98 are {1,4,4}, so a(98) = 1.
The prime indices of 294 are {1,2,4,4}, a(294) = 2.
The prime indices of 1911 are {2,4,4,6}, so a(1911) = 2.
The prime indices of 2548 are {1,1,4,4,6}, so a(2548) = 3.
		

Crossrefs

Positions of first appearances are A000079.
Positions of zero are A379307, counted by A114374 (strict A256012).
Positions of one are A379316, counted by A379308 (strict A379309).
A000040 lists the primes, differences A001223.
A005117 lists the squarefree numbers, differences A076259.
A008966 is the characteristic function for the squarefree numbers.
A013929 lists the nonsquarefree numbers, differences A078147.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A061398 counts squarefree numbers between primes, zeros A068360.
A377038 gives k-th differences of squarefree numbers.
Other counts of prime indices:
- A087436 postpositive, see A038550.
- A330944 nonprime, see A000586, A000607, A076610, A330945.
- A379310 nonsquarefree, see A302478.
- A379311 old prime, see A204389, A320629, A379312-A379315.

Programs

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

Formula

Totally additive with a(prime(k)) = A008966(k).

A379317 Positive integers with a unique even prime index.

Original entry on oeis.org

3, 6, 7, 12, 13, 14, 15, 19, 24, 26, 28, 29, 30, 33, 35, 37, 38, 43, 48, 51, 52, 53, 56, 58, 60, 61, 65, 66, 69, 70, 71, 74, 75, 76, 77, 79, 86, 89, 93, 95, 96, 101, 102, 104, 106, 107, 112, 113, 116, 119, 120, 122, 123, 130, 131, 132, 138, 139, 140, 141, 142
Offset: 1

Views

Author

Gus Wiseman, Dec 29 2024

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:
   3: {2}
   6: {1,2}
   7: {4}
  12: {1,1,2}
  13: {6}
  14: {1,4}
  15: {2,3}
  19: {8}
  24: {1,1,1,2}
  26: {1,6}
  28: {1,1,4}
  29: {10}
  30: {1,2,3}
  33: {2,5}
  35: {3,4}
  37: {12}
  38: {1,8}
  43: {14}
  48: {1,1,1,1,2}
		

Crossrefs

Partitions of this type are counted by A038348 (strict A096911).
For all even parts we have A066207, counted by A035363 (strict A000700).
For no even parts we have A066208, counted by A000009 (strict A035457).
Positions of 1 in A257992.
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.
Other counts of prime indices:
- A330944 nonprime, see A000586, A000607, A076610, A330945.
- A379311 old prime, see A204389, A320629, A379312-A379315.

Programs

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

A340691 Greatest image of A001222 over the prime indices of n.

Original entry on oeis.org

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

Views

Author

Gus Wiseman, Jan 28 2021

Keywords

Comments

For the initial term, we assume the empty set has maximum image 0.
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 prime indices of 4070 are {1,3,5,12} -> {0,1,1,3}, so a(4070) = 3.
The prime indices of 8892 are {1,1,2,2,6,8} -> {0,0,1,1,2,3} so a(8892) = 3.
		

Crossrefs

Positions of first appearances are A033844.
Positions of 0's are A000079.
Positions of terms <= 1 are A302540.
Positions of 1's are A302540 \ A000079.
The version for minimum is A340928.
A003963 multiplies together the prime indices.
A056239 adds up the prime indices.
A061395 selects the greatest prime index.
A072233 counts partitions by sum and maximum.
A112798 lists the prime indices of each positive integer.
A303975 counts distinct prime factors in the product of prime indices.

Programs

  • Mathematica
    Table[If[n==1,0,Max@@PrimeOmega/@PrimePi/@First/@FactorInteger[n]],{n,100}]

A379313 Positive integers whose prime indices are not all composite.

Original entry on oeis.org

2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 20, 21, 22, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 38, 39, 40, 41, 42, 44, 45, 46, 48, 50, 51, 52, 54, 55, 56, 57, 58, 59, 60, 62, 63, 64, 65, 66, 67, 68, 69, 70, 72, 74, 75, 76, 77, 78, 80, 81, 82
Offset: 1

Views

Author

Gus Wiseman, Dec 28 2024

Keywords

Comments

Or, positive integers whose prime indices include at least one 1 or prime number.
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:
     2: {1}
     3: {2}
     4: {1,1}
     5: {3}
     6: {1,2}
     8: {1,1,1}
     9: {2,2}
    10: {1,3}
    11: {5}
    12: {1,1,2}
    14: {1,4}
    15: {2,3}
    16: {1,1,1,1}
    17: {7}
    18: {1,2,2}
    20: {1,1,3}
    21: {2,4}
    22: {1,5}
    24: {1,1,1,2}
		

Crossrefs

Partitions of this type are counted by A000041 - A023895.
The "old" primes are listed by A008578.
For no composite parts we have A302540, counted by A034891 (strict A036497).
The complement is A320629, counted by A023895 (strict A204389).
For a unique prime we have A331915, counted by A379304 (strict A379305).
Positions of nonzeros in A379311.
For a unique 1 or prime we have A379312, counted by A379314 (strict A379315).
A000040 lists the prime numbers, differences A001223.
A002808 lists the composite numbers, nonprimes A018252, differences A073783 or A065310.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A080339 is the characteristic function for the old prime numbers.
A376682 gives k-th differences of old prime numbers, see A030016, A075526.
A377033 gives k-th differences of composite numbers, see A073445, A377034.
Other counts of prime indices:
- A330944 nonprime, see A002095, A096258, A320628, A330945.
- A379306 squarefree, see A302478, A379308, A379309, A379316.
- A379310 nonsquarefree, see A114374, A256012, A379307.

Programs

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

A340928 Least image of A001222 applied to the prime indices of n.

Original entry on oeis.org

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

Views

Author

Gus Wiseman, Jan 28 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.

Examples

			The prime indices of 4277 are {4,6,15} with images {2,2,2}, so a(4277) = 2.
The prime indices of 8303 are {8,8,9} with images {3,3,2}, so a(8303) = 2.
		

Crossrefs

Positions of 0's are A000079.
Positions of first appearances are A033844.
The version for maximum is A340691.
A003963 multiplies together the prime indices.
A026794 counts partitions by sum and minimum.
A056239 adds up the prime indices.
A061395 selects the greatest prime index.
A112798 lists the prime indices of each positive integer.

Programs

  • Mathematica
    Table[If[n==1,0,Min@@PrimeOmega/@PrimePi/@First/@FactorInteger[n]],{n,100}]

A371287 Numbers whose product of prime indices has exactly two distinct prime factors.

Original entry on oeis.org

13, 15, 26, 29, 30, 33, 35, 37, 39, 43, 45, 47, 51, 52, 55, 58, 60, 61, 65, 66, 69, 70, 71, 73, 74, 75, 77, 78, 79, 85, 86, 87, 89, 90, 91, 93, 94, 95, 99, 101, 102, 104, 105, 107, 110, 111, 116, 117, 119, 120, 122, 123, 129, 130, 132, 135, 137, 138, 139, 140
Offset: 1

Views

Author

Gus Wiseman, Mar 21 2024

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:
  13: {6}
  15: {2,3}
  26: {1,6}
  29: {10}
  30: {1,2,3}
  33: {2,5}
  35: {3,4}
  37: {12}
  39: {2,6}
  43: {14}
  45: {2,2,3}
  47: {15}
  51: {2,7}
  52: {1,1,6}
  55: {3,5}
  58: {1,10}
  60: {1,1,2,3}
		

Crossrefs

Positions of 2's in A303975 (positions of 1's are A320698).
Counting divisors (not factors) gives A371127, positions of 2's in A370820.
A000005 counts divisors.
A000961 lists powers of primes, of prime index A302596.
A001221 counts distinct prime factors.
A001358 lists semiprimes, squarefree A006881.
A003963 gives product of prime indices.
A027746 lists prime factors, indices A112798, length A001222.
A076610 lists products of primes of prime index.
A355731 counts choices of a divisor of each prime index, firsts A355732.
A355741 counts choices of a prime factor of each prime index.

Programs

  • Mathematica
    Select[Range[100],2==PrimeNu[Times @@ PrimePi/@First/@If[#==1,{},FactorInteger[#]]]&]

Formula

A001221(A003963(a(n))) = A303975(a(n)) = 2.
Previous Showing 11-20 of 20 results.