A072978 -id:A072978 - cp's OEIS frontend

A080784 Duplicate of A072978.

1, 6, 10, 14, 22, 26, 34, 36, 38, 46, 58, 60, 62, 74, 82, 84, 86, 94, 100, 106, 118, 122

Offset: 1

dead

A028260 Numbers with an even number of prime divisors (counted with multiplicity); numbers k such that the Liouville function lambda(k) (A008836) is positive.

1, 4, 6, 9, 10, 14, 15, 16, 21, 22, 24, 25, 26, 33, 34, 35, 36, 38, 39, 40, 46, 49, 51, 54, 55, 56, 57, 58, 60, 62, 64, 65, 69, 74, 77, 81, 82, 84, 85, 86, 87, 88, 90, 91, 93, 94, 95, 96, 100, 104, 106, 111, 115, 118, 119, 121, 122, 123, 126, 129, 132, 133, 134

Offset: 1

Dan Asimov (dan(AT)research.att.com)

If k appears, p*k does not (p primes). - Philippe Deléham, Jun 10 2006
The product of any two terms of this sequence, or any two terms of the complement of this sequence (A026424), is a term of this sequence. The product of a term of this sequence and a term of A026424 is a term of A026424. The primitive terms of this sequence are the semiprimes (A001358). - Franklin T. Adams-Watters, Nov 27 2006
A072978 is a subsequence. - Reinhard Zumkeller, Sep 20 2008
Quadratic residues of A191089(n) as n -> oo. - Travis Scott, Jan 14 2023

T. D. Noe, Table of n, a(n) for n = 1..10000
S. Ramanujan, Irregular numbers, J. Indian Math. Soc., 5 (1913), 105-106; Coll. Papers 20-21.

Cf. A001222, A001358, A008836, A026424 (complement), A145784, A065043 (char. func).

a028260 n = a028260_list !! (n-1)
a028260_list = filter (even . a001222) [1..]
-- Reinhard Zumkeller, Oct 05 2011

with(numtheory); A028260 := proc(n) option remember: local k: if(n=1)then return 1: fi: for k from procname(n-1)+1 do if(bigomega(k) mod 2=0)then return k: fi: od: end: seq(A028260(n),n=1..63); # Nathaniel Johnston, May 27 2011

Select[Range[200],EvenQ[PrimeOmega[#]]&] (* Harvey P. Dale, Aug 14 2011 *)
Select[Range@ 134, LiouvilleLambda@# > 0 &] (* Robert G. Wilson v, Jul 06 2012 *)

is(n)=bigomega(n)%2==0 \\ Charles R Greathouse IV, May 29 2013

from math import isqrt, prod
from sympy import primerange, primepi, integer_nthroot
def A028260(n):
    def g(x,a,b,c,m): yield from (((d,) for d in enumerate(primerange(b,isqrt(x//c)+1),a)) if m==2 else (((a2,b2),)+d for a2,b2 in enumerate(primerange(b,integer_nthroot(x//c,m)[0]+1),a) for d in g(x,a2,b2,c*b2,m-1)))
    def f(x): return int(n+x-1-sum(sum(primepi(x//prod(c[1] for c in a))-a[-1][0] for a in g(x,0,1,1,m)) for m in range(2,x.bit_length()+1,2)))
    m, k = n, f(n)
    while m != k: m, k = k, f(k)
    return m # Chai Wah Wu, Apr 10 2025

A066829(a(n)) = 0. - Reinhard Zumkeller, Jun 26 2009
A001222(a(n)) mod 2 = 0. - Reinhard Zumkeller, Oct 05 2011
Sum_{n>=1} 1/a(n)^s = (zeta(s)^2 + zeta(2*s))/(2*zeta(s)). - Enrique Pérez Herrero, Jul 06 2012

A359912 Numbers whose prime indices do not have integer median.

Original entry on oeis.org

1, 6, 14, 15, 26, 33, 35, 36, 38, 51, 58, 60, 65, 69, 74, 77, 84, 86, 93, 95, 106, 119, 122, 123, 132, 141, 142, 143, 145, 150, 156, 158, 161, 177, 178, 185, 196, 201, 202, 204, 209, 210, 214, 215, 216, 217, 219, 221, 225, 226, 228, 249, 262, 265, 276, 278

Offset: 1

Gus Wiseman, Jan 24 2023

nonn

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

			The terms together with their prime indices begin:
   1: {}
   6: {1,2}
  14: {1,4}
  15: {2,3}
  26: {1,6}
  33: {2,5}
  35: {3,4}
  36: {1,1,2,2}
  38: {1,8}
  51: {2,7}
  58: {1,10}
  60: {1,1,2,3}

For prime factors instead of indices we have A072978, complement A359913.
These partitions are counted by A307683.
For mean instead of median: A348551, complement A316413, counted by A349156.
The complement is A359908, counted by A325347.
Positions of odd terms in A360005.
A112798 lists prime indices, length A001222, sum A056239.
A326567/A326568 gives the mean of prime indices, conjugate A326839/A326840.
A359893 and A359901 count partitions by median, odd-length A359902.
Cf. A026424, A051293, A067538, A175352, A175761, A289509, A359890, A359905, A360006, A359907, A360009.

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

A360556 Numbers > 1 whose first differences of 0-prepended prime indices have integer median.

Original entry on oeis.org

2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 14, 16, 17, 18, 19, 20, 21, 23, 26, 27, 28, 29, 30, 31, 32, 35, 37, 38, 39, 41, 42, 43, 44, 45, 47, 48, 49, 50, 52, 53, 57, 58, 59, 60, 61, 63, 64, 65, 66, 67, 68, 70, 71, 72, 73, 74, 75, 76, 78, 79, 80, 81, 83, 84, 86, 87, 89

Offset: 1

Gus Wiseman, Feb 16 2023

nonn

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

			The 0-prepended prime indices of 1617 are {0,2,4,4,5}, with sorted differences {0,1,2,2}, with median 3/2, so 1617 is not in the sequence.

For mean instead of median we have A340610.
Positions of even terms in A360555.
The complement is A360557 (without 1).
These partitions are counted by A360688.
- For divisors (A063655) we have A139711, complement A139710.
- For prime indices (A360005) we have A359908, complement A359912.
- For distinct prime indices (A360457) we have A360550, complement A360551.
- For distinct prime factors (A360458) we have A360552, complement A100367.
- For prime factors (A360459) we have A359913, complement A072978.
- For prime multiplicities (A360460) we have A360553, complement A360554.
- For 0-prepended differences (A360555) we have A360556, complement A360557.
A112798 lists prime indices, length A001222, sum A056239.
A325347 = partitions w/ integer median, complement A307683, strict A359907.
A359893 and A359901 count partitions by median, odd-length A359902.
A360614/A360615 = mean of first differences of 0-prepended prime indices.
Cf. A000975, A026424, A078175, A316413, A360009, A360558, A360669, A360681.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[2,100],IntegerQ[Median[Differences[Prepend[prix[#],0]]]]&]

A360550 Numbers > 1 whose distinct prime indices have integer median.

Original entry on oeis.org

2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 16, 17, 19, 20, 21, 22, 23, 25, 27, 29, 30, 31, 32, 34, 37, 39, 40, 41, 42, 43, 44, 46, 47, 49, 50, 53, 55, 57, 59, 60, 61, 62, 63, 64, 66, 67, 68, 70, 71, 73, 78, 79, 80, 81, 82, 83, 84, 85, 87, 88, 89, 90, 91, 92, 94, 97, 100

Offset: 1

Gus Wiseman, Feb 14 2023

nonn

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. Distinct prime indices are listed by A304038.

The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).

			The prime indices of 900 are {1,1,2,2,3,3}, with distinct parts {1,2,3}, with median 2, so 900 is in the sequence.
The prime indices of 330 are {1,2,3,5},  with distinct parts {1,2,3,5}, with median 5/2, so 330 is not in the sequence.

For mean instead of median we have A326621.
Positions of even terms in A360457.
The complement (without 1) is A360551.
Partitions with these Heinz numbers are counted by A360686.
- For divisors (A063655) we have A139711, complement A139710.
- For prime indices (A360005) we have A359908, complement A359912.
- For distinct prime indices (A360457) we have A360550, complement A360551.
- For distinct prime factors (A360458) we have A360552, complement A100367.
- For prime factors (A360459) we have A359913, complement A072978.
- For prime multiplicities (A360460) we have A360553, complement A360554.
- For 0-prepended differences (A360555) we have A360556, complement A360557.
A112798 lists prime indices, length A001222, sum A056239.
A304038 lists distinct prime indices, length A001221, sum A066328.
A325347 = partitions w/ integer median, complement A307683, strict A359907.
A326619/A326620 gives mean of distinct prime indices.
A359893 and A359901 count partitions by median, odd-length A359902.
Cf. A000975, A026424, A316413, A360006, A360009, A360248, A360453.

Select[Range[2,100],IntegerQ[Median[PrimePi/@First/@FactorInteger[#]]]&]

A345452 Positive integers with an even number of prime factors (counting repetitions) that sum to an even number.

Original entry on oeis.org

1, 4, 9, 15, 16, 21, 25, 33, 35, 36, 39, 49, 51, 55, 57, 60, 64, 65, 69, 77, 81, 84, 85, 87, 91, 93, 95, 100, 111, 115, 119, 121, 123, 129, 132, 133, 135, 140, 141, 143, 144, 145, 155, 156, 159, 161, 169, 177, 183, 185, 187, 189, 196, 201, 203, 204, 205, 209, 213, 215

Offset: 1

Peter Munn, Jun 20 2021

Numbers with an even number of even prime factors and an even number of odd prime factors.
The representation (as defined in A206284) of polynomials with nonnegative integer coefficients that are in the ideal of the polynomial ring Z[x] generated by x^2+x and 2.
The above property arises because the sequence lists the integers in the multiplicative subgroup of positive rational numbers generated by the squares of primes (A001248) and the products of two consecutive odd primes (A006094\{6}).
The sequence is closed under multiplication, prime shift (A003961), and - where the result is an integer - under division. Using these closures, all the terms can be derived from the presence of 4 and 15. For example, A003961(4) = 9, A003961(9) = 25, A003961(15) = 35, 15 * 35 = 525, 525/25 = 21. Alternatively, the sequence may be defined as the closure of A046337 under multiplication by 4.
From the properties of subgroups of the positive rationals we know that if we take an absent positive integer m and divide all terms that are multiples of m by m, we get all the integers in the same subgroup coset as m, and we can expect some of the nice properties here to carry over to the resulting set. Specifically, dividing the even terms by 2 gives all numbers with an odd number of prime factors that sum to an even number; dividing all terms divisible by an odd prime p by p, gives all numbers with an odd number of prime factors that sum to an odd number. The positive integers satisfying the 4th of the 4 possibilities are generated similarly, dividing by 6 (for example).
Numbers whose squarefree part is in A056913.
Term by term, the sequence is one half of its complement within A036349.

			The definition specifies that we count repeated prime factors.
6 = 2 * 3; the sum of these prime factors is 2 + 3 = 5, an odd number; so 6 is not in the sequence.
50 = 2 * 5 * 5 has 3 prime factors and 3 is an odd number; so 50 is not in the sequence.
60 = 2 * 2 * 3 * 5 has 4 prime factors and 4 is an even number; the sum of these factors is 2 + 2 + 3 + 5 = 12, also an even number; so 60 is in the sequence.
1 has 0 prime factors, which sum to 0 (the empty sum). 0 is even, so 1 is in the sequence.

Eric Weisstein's World of Mathematics, Group.
Wikipedia, Polynomial ring.

Cf. A001222, A001414, A003961, A059897, A307150.
Intersection of any 2 of A003159, A028260, A036349.
Other lists that have conditions on the number of odd prime factors: A046337, A072978.
Subsequences: A001248, A006094\{6}, A046315, A056913.

{1}~Join~Select[Range@1000,(s=Flatten[Table@@@FactorInteger[#]];And@@EvenQ@{Length@s,Total@s})&] (* Giorgos Kalogeropoulos, Jun 24 2021 *)

iseven(x) = ((x%2) == 0);
isok(m) = my(f=factor(m)); iseven(sum(k=1, #f~, f[k,1]*f[k,2])) && iseven(sum(k=1, #f~, f[k,2])); \\ Michel Marcus, Jun 24 2021

is(n) = bigomega(n)%2 == 0 && valuation(n, 2)%2 == 0 \\ David A. Corneth, Jun 24 2021

from sympy import factorint
def ok(n):
    f = factorint(n)
    return sum(f.values())%2 == 0 and sum(p*f[p] for p in f)%2 == 0
print(list(filter(ok, range(1, 216)))) # Michael S. Branicky, Jun 24 2021

{a(n) : n >= 1} = {m >= 1 : A001222(m) mod 2 = A001414(m) mod 2 = 0}.
{A036349(n) : n >= 1} = {a(n) : n >= 1} U {2 * a(n) : n >= 1}.
{A028260(n) : n >= 1} = {a(n) : n >= 1} U {A307150(a(n)) : n >= 1}.
For odd prime p, {A003159(n) : n >= 1} = {a(n) : n >= 1} U {A059897(a(n), p) : n >= 1}.

A360459 Two times the median of the multiset of prime factors of n; a(1) = 2.

Original entry on oeis.org

2, 4, 6, 4, 10, 5, 14, 4, 6, 7, 22, 4, 26, 9, 8, 4, 34, 6, 38, 4, 10, 13, 46, 4, 10, 15, 6, 4, 58, 6, 62, 4, 14, 19, 12, 5, 74, 21, 16, 4, 82, 6, 86, 4, 6, 25, 94, 4, 14, 10, 20, 4, 106, 6, 16, 4, 22, 31, 118, 5, 122, 33, 6, 4, 18, 6, 134, 4, 26, 10, 142, 4, 146

Offset: 1

Gus Wiseman, Feb 14 2023

nonn

The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length). Since the denominator is always 1 or 2, the median can be represented as an integer by multiplying by 2.

			The prime factors of 60 are {2,2,3,5}, with median 5/2, so a(60) = 5.

The union is 2 followed by A014091, complement of A014092.
The prime factors themselves are listed by A027746, distinct A027748.
The version for divisors is A063655.
Positions of odd terms are A072978 (except 1).
For mean instead of twice median: A123528/A123529, distinct A323171/A323172.
Positions of even terms are A359913 (and 1).
The version for prime indices is A360005.
The version for distinct prime indices is A360457.
The version for distinct prime factors is A360458.
The version for prime multiplicities is A360460.
The version for 0-prepended differences is A360555.
A112798 lists prime indices, length A001222, sum A056239.
A325347 counts partitions with integer median, complement A307683.
A326567/A326568 gives mean of prime indices.
A359893 and A359901 count partitions by median, odd-length A359902.
Cf. A000975, A026424, A027336, A078174, A316413, A359907, A359908, A360006, A360007, A360248, A360552.

Table[2*Median[Join@@ConstantArray@@@FactorInteger[n]],{n,100}]

A360551 Numbers > 1 whose distinct prime indices have non-integer median.

Original entry on oeis.org

6, 12, 14, 15, 18, 24, 26, 28, 33, 35, 36, 38, 45, 48, 51, 52, 54, 56, 58, 65, 69, 72, 74, 75, 76, 77, 86, 93, 95, 96, 98, 99, 104, 106, 108, 112, 116, 119, 122, 123, 135, 141, 142, 143, 144, 145, 148, 152, 153, 158, 161, 162, 172, 175, 177, 178, 185, 192, 196

Offset: 1

Gus Wiseman, Feb 16 2023

nonn

First differs from A325700 in having 330 and lacking 462.
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. Distinct prime indices are listed by A304038.
The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).

			The prime indices of 900 are {1,1,2,2,3,3}, with distinct parts {1,2,3}, with median 2, so 900 is not in the sequence.
The prime indices of 462 are {1,2,4,5}, with distinct parts {1,2,4,5}, with median 3, so 462 is not in the sequence.

For mean instead of median we have the complement of A326621.
Positions of odd terms in A360457.
The complement (without 1) is A360550, counted by A360686.
- For divisors (A063655) we have A139710, complement A139711.
- For prime indices (A360005) we have A359912, complement A359908.
- For distinct prime indices (A360457) we have A360551 complement A360550.
- For distinct prime factors (A360458) we have A100367, complement A360552.
- For prime factors (A360459) we have A072978, complement A359913.
- For prime multiplicities (A360460) we have A360554, complement A360553.
- For 0-prepended differences (A360555) we have A360557, complement A360556.
A112798 lists prime indices, length A001222, sum A056239.
A304038 lists distinct prime indices, length A001221, sum A066328.
A325347 = partitions w/ integer median, complement A307683, strict A359907.
A326619/A326620 gives mean of distinct prime indices.
A359893 and A359901 count partitions by median, odd-length A359902.
Cf. A000975, A026424, A316413, A348551, A360006, A360009, A360248, A360453.

Select[Range[2,100],!IntegerQ[Median[PrimePi/@First/@FactorInteger[#]]]&]

A360554 Numbers > 1 whose unordered prime signature has non-integer median.

Original entry on oeis.org

12, 18, 20, 28, 44, 45, 48, 50, 52, 63, 68, 72, 75, 76, 80, 92, 98, 99, 108, 112, 116, 117, 124, 147, 148, 153, 162, 164, 171, 172, 175, 176, 188, 192, 200, 207, 208, 212, 236, 242, 244, 245, 261, 268, 272, 275, 279, 284, 288, 292, 304, 316, 320, 325, 332, 333

Offset: 1

Gus Wiseman, Feb 16 2023

nonn

First differs from A187039 in having 2520 and lacking 1 and 12600.
A number's unordered prime signature (row n of A118914) is the multiset of positive exponents in its prime factorization.
The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).

			The unordered prime signature of 2520 is {3,2,1,1}, with median 3/2, so 2520 is in the sequence.
The unordered prime signature of 12600 is {3,2,2,1}, with median 2, so 12600 is not in the sequence.

A subset of A030231.
For mean instead of median we have A070011.
Positions of odd terms in A360460.
The complement is A360553 (without 1), counted by A360687.
- For divisors (A063655) we have A139710, complement A139711.
- For prime indices (A360005) we have A359912, complement A359908.
- For distinct prime indices (A360457) we have A360551 complement A360550.
- For distinct prime factors (A360458) we have A100367, complement A360552.
- For prime factors (A360459) we have A072978, complement A359913.
- For prime multiplicities (A360460) we have A360554, complement A360553.
- For 0-prepended differences (A360555) we have A360557, complement A360556.
A112798 lists prime indices, length A001222, sum A056239.
A325347 = partitions w/ integer median, complement A307683, strict A359907.
A326619/A326620 gives mean of distinct prime indices.
A359893 and A359901 count partitions by median, odd-length A359902.
Cf. A000975, A026424, A304038, A316413, A326621, A348551, A360006, A360009, A360248, A360453.

Select[Range[2,100],!IntegerQ[Median[Last/@FactorInteger[#]]]&]

A360557 Numbers > 1 whose sorted first differences of 0-prepended prime indices have non-integer median.

Original entry on oeis.org

4, 10, 15, 22, 24, 25, 33, 34, 36, 40, 46, 51, 54, 55, 56, 62, 69, 77, 82, 85, 88, 93, 94, 100, 104, 115, 118, 119, 121, 123, 134, 135, 136, 141, 146, 152, 155, 161, 166, 177, 184, 187, 194, 196, 201, 205, 206, 217, 218, 219, 220, 221, 225, 232, 235, 240, 248

Offset: 1

Gus Wiseman, Feb 17 2023

nonn

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

			The 0-prepended prime indices of 1617 are {0,2,4,4,5}, with sorted differences {0,1,2,2}, with median 3/2, so 1617 is in the sequence.

For mean instead of median complement we have A340610, counted by A168659.
For mean instead of median we have A360668, counted by A200727.
Positions of odd terms in A360555.
The complement is A360556 (without 1), counted by A360688.
These partitions are counted by A360691.
- For divisors (A063655) we have A139710, complement A139711.
- For prime indices (A360005) we have A359912, complement A359908.
- For distinct prime indices (A360457) we have A360551, complement A360550.
- For distinct prime factors (A360458) we have A100367, complement A360552.
- For prime factors (A360459) we have A072978, complement A359913.
- For prime multiplicities (A360460) we have A360554, complement A360553.
- For 0-prepended differences (A360555) we have A360557, complement A360556.
A112798 lists prime indices, length A001222, sum A056239.
A287352 lists 0-prepended first differences of prime indices.
A325347 counts partitions with integer median, complement A307683.
A355536 lists first differences of prime indices.
A359893 and A359901 count partitions by median, odd-length A359902.
A360614/A360615 = mean of first differences of 0-prepended prime indices.
Cf. A000975, A026424, A078175, A316413, A360009, A360558, A360669, A360681.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[2,100],!IntegerQ[Median[Differences[Prepend[prix[#],0]]]]&]

cp's OEIS Frontend

A080784 Duplicate of A072978.

Views

Author

Keywords

A028260 Numbers with an even number of prime divisors (counted with multiplicity); numbers k such that the Liouville function lambda(k) (A008836) is positive.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Python

Formula

A359912 Numbers whose prime indices do not have integer median.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A360556 Numbers > 1 whose first differences of 0-prepended prime indices have integer median.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A360550 Numbers > 1 whose distinct prime indices have integer median.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A345452 Positive integers with an even number of prime factors (counting repetitions) that sum to an even number.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Python

Formula

A360459 Two times the median of the multiset of prime factors of n; a(1) = 2.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A360551 Numbers > 1 whose distinct prime indices have non-integer median.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A360554 Numbers > 1 whose unordered prime signature has non-integer median.

Views