A100367 -id:A100367 - cp's OEIS frontend

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

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[#]]]&]

A360458 Two times the median of the set of distinct prime factors of n; a(1) = 2.

Original entry on oeis.org

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

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 336 are {2,2,2,2,3,7}, with distinct parts {2,3,7}, with median 3, so a(336) = 6.

The union is 2 followed by A014091, complement of A014092.
Distinct prime factors are listed by A027748.
The version for divisors is A063655.
Positions of odd terms are A100367.
For mean instead of two times median we have A323171/A323172.
The version for prime indices is A360005.
The version for distinct prime indices is A360457.
The version for prime factors is A360459.
The version for prime multiplicities is A360460.
Positions of even terms are A360552.
The version for 0-prepended differences is A360555.
A112798 lists prime indices, length A001222, sum A056239.
A304038 lists distinct prime indices.
A359893 and A359901 count partitions by median, odd-length A359902.
Cf. A000975, A026424, A078174, A316413, A325347, A359907, A360006, A360248, A360453, A360550, A360551.

Table[2*Median[First/@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]]]]&]

A360553 Numbers > 1 whose unordered prime signature has integer median.

Original entry on oeis.org

2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 21, 22, 23, 24, 25, 26, 27, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 46, 47, 49, 51, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 64, 65, 66, 67, 69, 70, 71, 73, 74, 77, 78, 79, 81, 82, 83

Offset: 1

Gus Wiseman, Feb 16 2023

nonn

First differs from A067340 in having 60.
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 60 is {1,1,2}, with median 1, so 60 is in the sequence.
The unordered prime signature of 1260 is {1,1,2,2}, with median 3/2, so 1260 is not in the sequence.

For mean instead of median we have A067340, complement A070011.
Positions of even terms in A360460.
The complement is A360554 (without 1).
These partitions are counted by A360687.
- 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.
A124010 lists prime signature.
A325347 = partitions w/ integer median, complement A307683, strict A359907.
A359893 and A359901 count partitions by median, odd-length A359902.
A360454 = numbers whose prime indices and signature have the same median.
Cf. A000975, A026424, A078174, A078175, A316413, A326621, A360453.

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

A360552 Numbers > 1 whose distinct prime factors have integer median.

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, Feb 16 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).

			The prime factors of 900 are {2,2,3,3,5,5}, with distinct parts {2,3,5}, with median 3, so 900 is in the sequence.

For mean instead of median we have A078174, complement of A176587.
The complement is A100367 (without 1).
Positions of even terms in A360458.
- 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.
A027746 lists prime factors, length A001222, indices A112798.
A027748 lists distinct prime factors, length A001221, indices A304038.
A323171/A323172 = mean of distinct prime factors, indices A326619/A326620.
A325347 = partitions w/ integer median, complement A307683, strict A359907.
A359893 and A359901 count partitions by median, odd-length A359902.
Cf. A000975, A026424, A056239, A078175, A175352, A316413, A326621, A360009.

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

A019507 Droll numbers: numbers > 1 whose sum of even prime factors equals the sum of odd prime factors.

Original entry on oeis.org

72, 240, 672, 800, 2240, 4224, 5184, 6272, 9984, 14080, 17280, 33280, 39424, 48384, 52224, 57600, 93184, 116736, 161280, 174080, 192000, 247808, 304128, 373248, 389120, 451584, 487424, 537600, 565248, 585728, 640000, 718848, 1013760, 1089536, 1244160, 1384448

Offset: 1

Mario Velucchi (mathchess(AT)velucchi.it)

nonn

			6272 = 2*2*2*2*2*2*2*7*7 is droll since 2+2+2+2+2+2+2 = 14 = 7+7.

Donovan Johnson, Table of n, a(n) for n = 1..1000
Giovanni Resta, Droll numbers, Numbers Aplenty.

For count instead of sum we have A072978.
Partitions of this type are counted by A239261, without zero terms A249914.
For prime indices instead of factors we have A366748, zeros of A366749.
The LHS is A366839 with alternating zeros, for indices A366531, triangle A113686.
The RHS is A366840, for indices A366528, triangle A113685.
A000009 counts partitions into odd parts, ranks A066208.
A035363 counts partitions into even parts, ranks A066207.
A112798 lists prime indices, length A001222, sum A056239.
A257991 counts odd prime indices, even A257992.
A300061 lists numbers with even sum of prime indices, odd A300063.
Cf. A028260, A045931, A100367, A106529, A195017, A239241, A241638, A325698, A325700, A366533.

f:= proc(k, m) # numbers whose sum of prime factors >= m is k; m is prime
   local S,p,j;
   option remember;
   if k = 0 then return [1]
   elif m > k then return []
   fi;
   S:= NULL:
   p:= nextprime(m);
   for j from k by -m to 0 do
     S:= S, op(map(`*`,  procname(j,p) , m^((k-j)/m)))
   od;
   [S]
end proc:
g:= proc(N) local m,R;
  R:= NULL;
  for m from 1 while 2^m < N do
   R:= R, op(map(`*`,select(`<=`,f(2*m,3), N/2^m),2^m));
  od;
  sort([R])
end proc:
g(10^8); # Robert Israel, Feb 20 2025

Select[Range[2, 2*10^6, 2], First[#] == Total[Rest[#]] & [Times @@@ FactorInteger[#]] &] (* Paolo Xausa, Feb 19 2025 *)

isok(n) = {if (n % 2, return (0)); f = factor(n); return (2*f[1,2] == sum(i=2, #f~, f[i,1]*f[i,2]));} \\ Michel Marcus, Jun 21 2013

These are even numbers k such that A366839(k/2) = A366840(k). - Gus Wiseman, Oct 25 2023 (corrected Feb 19 2025)

Name edited by Paolo Xausa, Feb 19 2025

A100368 Numbers of the form 2^k * p where k > 0 and p is an odd prime.

Original entry on oeis.org

6, 10, 12, 14, 20, 22, 24, 26, 28, 34, 38, 40, 44, 46, 48, 52, 56, 58, 62, 68, 74, 76, 80, 82, 86, 88, 92, 94, 96, 104, 106, 112, 116, 118, 122, 124, 134, 136, 142, 146, 148, 152, 158, 160, 164, 166, 172, 176, 178, 184, 188, 192, 194, 202, 206, 208, 212, 214, 218, 224

Offset: 1

Labos Elemer, Nov 22 2004

Even numbers with 2 distinct prime factors where the odd factor is prime.
A proper subset of A098202. E.g., 210 is not here, but it is there. Also differs from A100367: 36, 100, 108, 196, etc. are missing here. Different also from A036348 because 90 and 180 are not here.
A128691 is a subsequence; A078834(a(n)) = A006530(a(n)). - Reinhard Zumkeller, Sep 19 2011
Composite numbers k having the property that the number of divisors of 2k equals the number of divisors of k + 2. All primes satisfy this property. - Gary Detlefs, Jan 23 2019

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Cf. A001221, A038550, A098902, A100367, A036348, A100484.

a:=Filtered([1..224],n->Tau(2*n)=Tau(n)+2 and not IsPrime(n));; Print(a); # Muniru A Asiru, Jan 22 2019

import Data.Set (singleton, deleteFindMin, insert)
a100368 n = a100368_list !! (n-1)
a100368_list = f (singleton 6) (tail a065091_list) where
f s ps'@(p:ps) | mod m 4 > 0 = m : f (insert (2*p) $ insert (2*m) s') ps
| otherwise = m : f (insert (2*m) s') ps'
where (m,s') = deleteFindMin s
-- Reinhard Zumkeller, Sep 19 2011

N:= 1000: # to get all terms <= N
P:= select(isprime, [seq(i,i=3..N/2,2)]):
S:= {seq(seq(2^i*p,i=1..ilog2(N/p)),p=P)}:
sort(convert(S,list)); # Robert Israel, Jul 09 2017
with(numtheory): for n from 1 to 224 do if tau(2*n)=tau(n)+2 and not isprime(n) then print(n) fi od # Gary Detlefs, Jan 22 2019

Mathematica
```
<Harvey P. Dale, Sep 03 2016 *)
```

is(n)=n%2==0 && isprime(n>>valuation(n,2)) \\ Charles R Greathouse IV, Jul 09 2017

list(lim)=my(v=List()); for(k=1,logint(lim\3,2), forprime(p=3,lim>>k, listput(v,p<Charles R Greathouse IV, Jul 09 2017

Numbers of the form 2^k*p where k > 0, p is an odd prime.

a(n) = 2*A038550(n). - Amiram Eldar, Dec 21 2020

Name edited by Charles R Greathouse IV, Jul 09 2017

cp's OEIS Frontend

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

A360458 Two times the median of the set of distinct 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

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A360553 Numbers > 1 whose unordered prime signature has integer median.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A360552 Numbers > 1 whose distinct prime factors have integer median.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A019507 Droll numbers: numbers > 1 whose sum of even prime factors equals the sum of odd prime factors.

Views

Author

Keywords

Examples

Links

Crossrefs