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 39 results. Next

A340019 MM-numbers of labeled graphs with half-loops, without isolated vertices.

Original entry on oeis.org

1, 3, 5, 11, 13, 15, 17, 29, 31, 33, 39, 41, 43, 47, 51, 55, 59, 65, 67, 73, 79, 83, 85, 87, 93, 101, 109, 123, 127, 129, 137, 139, 141, 143, 145, 149, 155, 157, 163, 165, 167, 177, 179, 187, 191, 195, 199, 201, 205, 211, 215, 219, 221, 233, 235, 237, 241, 249
Offset: 1

Views

Author

Gus Wiseman, Jan 02 2021

Keywords

Comments

Here a half-loop is an edge with only one vertex, to be distinguished from a full loop, which has two equal vertices.
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 multiset of multisets with MM-number n is formed by taking the multiset of prime indices of each part of the multiset of prime indices of n. For example, the prime indices of 78 are {1,2,6}, so the multiset of multisets with MM-number 78 is {{},{1},{1,2}}.
Also products of distinct primes whose prime indices are either themselves prime or a squarefree semiprime (A006881).

Examples

			The sequence of terms together with their corresponding multisets of multisets (edge sets) begins:
     1: {}              55: {{2},{3}}      137: {{2,5}}
     3: {{1}}           59: {{7}}          139: {{1,7}}
     5: {{2}}           65: {{2},{1,2}}    141: {{1},{2,3}}
    11: {{3}}           67: {{8}}          143: {{3},{1,2}}
    13: {{1,2}}         73: {{2,4}}        145: {{2},{1,3}}
    15: {{1},{2}}       79: {{1,5}}        149: {{3,4}}
    17: {{4}}           83: {{9}}          155: {{2},{5}}
    29: {{1,3}}         85: {{2},{4}}      157: {{12}}
    31: {{5}}           87: {{1},{1,3}}    163: {{1,8}}
    33: {{1},{3}}       93: {{1},{5}}      165: {{1},{2},{3}}
    39: {{1},{1,2}}    101: {{1,6}}        167: {{2,6}}
    41: {{6}}          109: {{10}}         177: {{1},{7}}
    43: {{1,4}}        123: {{1},{6}}      179: {{13}}
    47: {{2,3}}        127: {{11}}         187: {{3},{4}}
    51: {{1},{4}}      129: {{1},{1,4}}    191: {{14}}
		

Crossrefs

The version with full loops covering an initial interval is A320461.
The case covering an initial interval is A340018.
The version with full loops is A340020.
A006450 lists primes of prime index.
A106349 lists primes of semiprime index.
A257994 counts prime prime indices.
A302242 is the weight of the multiset of multisets with MM-number n.
A302494 lists MM-numbers of sets of sets, with connected case A328514.
A309356 lists MM-numbers of simple graphs.
A322551 lists primes of squarefree semiprime index.
A330944 counts nonprime prime indices.
A339112 lists MM-numbers of multigraphs with loops.
A339113 lists MM-numbers of multigraphs.

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    Select[Range[1000],And[SquareFreeQ[#],And@@(PrimeQ[#]||(SquareFreeQ[#]&&PrimeOmega[#]==2)&/@primeMS[#])]&]

A379316 Positive integers whose prime indices include a unique squarefree number.

Original entry on oeis.org

2, 3, 5, 11, 13, 14, 17, 21, 29, 31, 35, 38, 41, 43, 46, 47, 57, 59, 67, 69, 73, 74, 77, 79, 83, 91, 95, 98, 101, 106, 109, 111, 113, 115, 119, 122, 127, 137, 139, 142, 147, 149, 157, 159, 163, 167, 178, 179, 181, 183, 185, 191, 194, 199, 203, 206, 209, 211
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:
    2: {1}
    3: {2}
    5: {3}
   11: {5}
   13: {6}
   14: {1,4}
   17: {7}
   21: {2,4}
   29: {10}
   31: {11}
   35: {3,4}
   38: {1,8}
   41: {13}
   43: {14}
   46: {1,9}
		

Crossrefs

For all squarefree parts we have A302478, zeros of A379310.
Positions of 1 in A379306.
For no squarefree parts we have A379307, counted by A114374, strict A256012.
Partitions of this type are 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.
Other counts of prime indices:
- A330944 nonprime, see A000586, A000607, A076610, A330945.
- A379311 prime or 1, 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]]==1&]

A379300 Number of prime indices of n that are composite.

Original entry on oeis.org

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

Crossrefs

Positions of first appearances are A000420.
Positions of zero are A302540, counted by A034891 (strict A036497).
Positions of one are A379301, counted by A379302 (strict A379303).
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.
A066247 is the characteristic function for the composite numbers.
A377033 gives k-th differences of composite numbers, see A073445, A377034-A377037.
Other counts of prime indices:
- A087436 postpositive, see A038550.
- A330944 nonprime, see A002095, A096258, A320628, A330945.
- A379306 squarefree, see A302478, A379308, A379309, A379316.
- A379310 nonsquarefree, see A114374, A256012, A379307.
- A379311 old prime, see A379312-A379315.

Programs

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

Formula

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

A379311 Number of prime indices of n that are 1 or prime.

Original entry on oeis.org

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

Crossrefs

Positions of first appearances are A000079.
These "old" primes are listed by A008578.
Positions of zero are A320629, counted by A023895 (strict A204389).
Positions of one are A379312, counted by A379314 (strict A379315).
Positions of nonzero terms are A379313.
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, A173390, A376683, A376855.
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}]]]];
    Table[Length[Select[prix[n],#==1||PrimeQ[#]&]],{n,100}]

Formula

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

A379314 Number of integer partitions of n with a unique 1 or prime part.

Original entry on oeis.org

0, 1, 1, 1, 0, 2, 1, 3, 1, 4, 3, 8, 3, 10, 6, 14, 8, 22, 12, 30, 18, 40, 26, 58, 33, 76, 53, 103, 69, 140, 94, 185, 132, 239, 176, 323, 232, 417, 320, 536, 414, 704, 544, 900, 721, 1145, 936, 1481, 1198, 1867, 1571, 2363, 2001, 3003, 2550, 3768, 3275, 4712
Offset: 0

Views

Author

Gus Wiseman, Dec 28 2024

Keywords

Examples

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

Crossrefs

For all prime parts we have A000607 (strict A000586), ranks A076610.
For no prime parts we have A002095 (strict A096258), ranks A320628.
Ranked by A379312 = positions of 1 in A379311.
For a unique composite part we have A379302 (strict A379303), ranks A379301.
The strict case is A379315.
For squarefree instead of old prime we have A379308 (strict A379309), ranks A379316.
Considering 1 nonprime gives A379304 (strict A379305), ranks A331915.
A000040 lists the prime numbers, differences A001223.
A000041 counts integer partitions, strict A000009.
A002808 lists the composite numbers, nonprimes A018252, differences A073783 or A065310.
A376682 gives k-th differences of old primes.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],Count[#,_?(#==1||PrimeQ[#]&)]==1&]],{n,0,30}]
  • PARI
    seq(n)={Vec(sum(k=1, n, if(isprime(k) || k==1, x^k))/prod(k=4, n, 1 - if(!isprime(k), x^k), 1 + O(x^n)), -n-1)} \\ Andrew Howroyd, Dec 28 2024

A330943 Matula-Goebel numbers of singleton-reduced rooted trees.

Original entry on oeis.org

1, 2, 4, 6, 7, 8, 12, 13, 14, 16, 18, 19, 21, 24, 26, 28, 32, 34, 36, 37, 38, 39, 42, 43, 48, 49, 52, 53, 54, 56, 57, 61, 63, 64, 68, 72, 73, 74, 76, 78, 82, 84, 86, 89, 91, 96, 98, 101, 102, 104, 106, 107, 108, 111, 112, 114, 117, 119, 122, 126, 128, 129, 131
Offset: 1

Views

Author

Gus Wiseman, Jan 13 2020

Keywords

Comments

These trees are counted by A330951.
A rooted tree is singleton-reduced if no non-leaf node has all singleton branches, where a rooted tree is a singleton if its root has degree 1.
The Matula-Goebel number of a rooted tree is the product of primes of the Matula-Goebel numbers of its branches. This gives a bijective correspondence between positive integers and unlabeled rooted trees.
A prime index of n is a number m such that prime(m) divides n. A number belongs to this sequence iff it is 1 or its prime indices all belong to this sequence but are not all prime.

Examples

			The sequence of all singleton-reduced rooted trees together with their Matula-Goebel numbers begins:
   1: o
   2: (o)
   4: (oo)
   6: (o(o))
   7: ((oo))
   8: (ooo)
  12: (oo(o))
  13: ((o(o)))
  14: (o(oo))
  16: (oooo)
  18: (o(o)(o))
  19: ((ooo))
  21: ((o)(oo))
  24: (ooo(o))
  26: (o(o(o)))
  28: (oo(oo))
  32: (ooooo)
  34: (o((oo)))
  36: (oo(o)(o))
  37: ((oo(o)))
		

Crossrefs

The series-reduced case is A291636.
Unlabeled rooted trees are counted by A000081.
Numbers whose prime indices are not all prime are A330945.
Singleton-reduced rooted trees are counted by A330951.
Singleton-reduced phylogenetic trees are A000311.
The set S of numbers whose prime indices do not all belong to S is A324694.

Programs

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

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).

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&]
Previous Showing 11-20 of 39 results. Next