A002975 -id:A002975 - cp's OEIS frontend

A322524 Primitive weird numbers (pwn; A002975) divisible by 4 but not 8.

836, 45356, 91388, 243892, 254012, 338572, 343876, 388076, 29465852, 120888092, 259858324, 260378492, 410832532, 775397948, 785187524, 903217276, 989226964, 1609445332, 2358115084, 3254323124, 3381352084, 3381872252, 3781448788, 3782267372, 5056717796, 5065605532

Offset: 1

Robert G. Wilson v, Dec 13 2018

nonn

			a(1) = 836 = 2^2 * 11 * 19;
a(2) = 45356 = 2^2 * 17 * 23 * 29;
a(3) = 91388 = 2^2 * 11 * 31 * 67; etc.

Cf. A002975, A258375, A258401, A258882, A258883, A258884, A258885, A319735.

(* import the b-file in A002975 and assign it to lst *); Select[lst, IntegerExponent[#, 2] == 2 &]

A006037 Weird numbers: abundant (A005101) but not pseudoperfect (A005835).

Original entry on oeis.org

70, 836, 4030, 5830, 7192, 7912, 9272, 10430, 10570, 10792, 10990, 11410, 11690, 12110, 12530, 12670, 13370, 13510, 13790, 13930, 14770, 15610, 15890, 16030, 16310, 16730, 16870, 17272, 17570, 17990, 18410, 18830, 18970, 19390, 19670

Offset: 1

N. J. A. Sloane

OProject@Home in subproject Weird Engine calculates and stores the weird numbers.
There are no odd weird numbers < 10^17. - Robert A. Hearn (rah(AT)ai.mit.edu), May 25 2005
From Alois P. Heinz, Oct 30 2009: (Start)
The first weird number that has more than one decomposition of its divisors set into two subsets with equal sum (and thus is not a member of A083209) is 10430:
  1+5+7+10+14+35+298+10430 = 2+70+149+745+1043+1490+2086+5215
  2+70+298+10430 = 1+5+7+10+14+35+149+745+1043+1490+2086+5215. (End)
There are no odd weird numbers < 1.8*10^19. - Wenjie Fang, Sep 04 2013
S. Benkowski and P. Erdős (1974) proved that the asymptotic density W of weird numbers is positive. It can be shown that W < 0.0101 (see A005835). - Jaycob Coleman, Oct 26 2013
No odd weird number exists below 10^21. This search was done on the volunteer computing project yoyo@home. - Wenjie Fang, Feb 23 2014
No odd weird number with abundance less than 10^14 exists below 10^28. See Odd Weird Search link. - Wenjie Fang, Feb 25 2015
A weird number k multiplied by a prime p > sigma(k) is again weird. Primitive weird numbers (A002975) are those which are not a multiple of a smaller term, i.e., don't have a weird proper divisor. Sequence A065235 lists odd numbers that can be written in only one way as sum of their divisors, and A122036 lists those which are not in A136446, i.e., not sum of proper divisors > 1. - M. F. Hasler, Jul 30 2016

J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 70, p. 24, Ellipses, Paris 2008.
R. K. Guy, Unsolved Problems in Number Theory, B2.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
David Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, Revised edition 1987. See p. 129.

Donovan Johnson, Table of n, a(n) for n = 1..10000 (first 4901 terms from Lukasz Swierczewski)
Gianluca Amato, Maximilian Hasler, Giuseppe Melfi, and Maurizio Parton, Primitive weird numbers having more than three distinct prime factors, Riv. Mat. Univ. Parma, 7(1), (2016), 153-163, arXiv:1803.00324 [math.NT], 2018.
S. Benkoski, Are All Weird Numbers Even?, Problem E2308, Amer. Math. Monthly, 79 (7) (1972), 774.
S. J. Benkoski and P. Erdős, On weird and pseudoperfect numbers, Math. Comp., 28 (1974), pp. 617-623. Alternate link; 1975 corrigendum.
David Eppstein, Eqyptian Fractions.
Wenjie Fang, Searching on the boundary of abundance for odd weird numbers, arXiv:2207.12906 [math.NT], 2022.
R. K. Guy, Letter to N. J. A. Sloane with attachment, Jun. 1991.
H. J. Hindin, Quasipractical numbers, IEEE Communications Magazine, March 1980, pp. 41-45.
Odd Weird Search, Report on the recently completed batch, Feb 23 2015.
OProject, Weird numbers list.
J. Sandor and B. Crstici, Handbook of number theory II, chapter 1.8. [Broken link]
Eric Weisstein's World of Mathematics, Weird Number.
Wikipedia, Weird number.
Robert G. Wilson v, Letter to N. J. A. Sloane, Jan. 1992.
Robert G. Wilson v, Letter to N. J. A. Sloane, Oct. 1993.

Cf. A002975, A005101, A005835, A005100, A138850, A087167.

Cf. A210455.

a006037 n = a006037_list !! (n-1)
a006037_list = filter ((== 0) . a210455) a005101_list
-- Reinhard Zumkeller, Jan 21 2013

isA006037 := proc(n)
    isA005101(n) and not isA005835(n) ;
end proc:
for n from 1 do
    if isA006037(n) then
        print(n);
    end if;
end do: # R. J. Mathar, Jun 18 2015

(* first do *) Needs["DiscreteMath`Combinatorica`"] (* then *) fQ[n_] := Block[{d, l, t, i}, If[ DivisorSigma[1, n] > 2n && Mod[n, 6] != 0, d = Take[Divisors[n], {1, -2}]; l = 2^Length[d]; t = Table[ NthSubset[j, d], {j, l - 1}]; i = 1; While[i < l && Plus @@ t[[i]] != n, i++ ]]; If[i == l, True, False]]; Select[ Range[ 20000], fQ[ # ] &] (* Robert G. Wilson v, May 20 2005 *)

is_A006037(n,d=divisors(n),s=vecsum(d)-n,m=#d-1)={ m||return; while(d[m]>n, s-=d[m]; m--); d[m]n, is_A006037(n-d[m], d, s-d[m], m-1) && is_A006037(n, d, s-d[m], m-1), sM. F. Hasler, Mar 30 2008; improved and updated to current PARI syntax by M. F. Hasler, Jul 15 2016

is_A006037(n, d=divisors(n)[^-1], s=vecsum(d))={s>n && !is_A005835(n,d,s)} \\ Equivalent but slightly faster than the self-contained version above.-- For efficiency, ensure that the argument is even or add "!bittest(n,0) && ..." to check this first. - M. F. Hasler, Jul 17 2016

t=0; A006037=vector(100,i, until( is_A006037(t+=2),); t) \\ M. F. Hasler, Mar 30 2008

More terms from Jud McCranie, Oct 21 2001

A258882 Primitive weird numbers of the form 2^kpq with k > 0 and where p < q are odd primes.

Original entry on oeis.org

70, 836, 7192, 7912, 9272, 10792, 17272, 73616, 83312, 113072, 519712, 539744, 555616, 682592, 786208, 1188256, 1229152, 1901728, 2081824, 2189024, 3963968, 4128448, 4145216, 4486208, 4559552, 4632896, 4960448, 5440192, 5568448, 6460864, 6621632, 7354304, 7470272, 8000704, 8134208

Offset: 1

Douglas E. Iannucci and Robert G. Wilson v, Jun 14 2015

nonn

The number of terms < 10^n: 0, 1, 2, 5, 9, 15, 35, 61, 114, 204, 380, 696, 1703, 3548, 6726, 13137, ....
If 2^k*p*q is a weird number, it is necessarily primitive, and 2^(k+1) < p < 2^(k+2)-2 < q < 2^(2k+1).
No odd weird numbers are known and any even weird number must have at least 3 distinct prime factors, since all numbers of the form 2^k*p^m are deficient or pseudoperfect or perfect (iff m = 1 and p = 2^(k+1)-1 is a Mersenne prime). Sequence A258333 lists the number of terms in this sequence for given k. - M. F. Hasler, Jul 11 2016
Kravitz has shown that 2^k*p*q is a primitive weird number when the primes p and q satisfy p = (2^(k+1)*q-q-1)/(q+1-2^(k+1)). Many terms in this sequence are of this form, e.g., a(n) with n = 1, 2, 3, 4, 6, 7, 9, 10, 15, 23, 26, 38, 45, 75, 94, 144, 157, 187, 287, 327, 368, 370, 459, 607, 657, 658, .... Sequences A242025, A242998, ... are related to the special case where q is a Mersenne prime (A000668). - M. F. Hasler, Jul 12 2016
Weird numbers of the form 2^k*p*q are always primitive, so this condition could be omitted in the definition of this sequence. - M. F. Hasler, Jul 13 2016
About 35 years after Kravitz's work, the topic of weird numbers has regained interest after a CWU press release about students who used Kravitz's formula to find a large PWN of this form. See A242025 and A320875. - M. F. Hasler, Nov 20 2018

			a(1) = A002975(1) = 70 = 2*5*7.
a(2) = A002975(2) = 836 = 2^2*11*19.
A002975(3) = 4030 = 2*5*13*31 is not in this sequence since it is not of the required form.
The same is true for A002975(4) = 5830.
a(3) = A002975(5) = 7192 = 2^3*29*31, etc.
A002975(179) = 2319548096 = 2^6 * 137^2 * 1931 is the first term of A002975 with only two odd prime divisors, but not of the required form. - _M. F. Hasler_, Nov 20 2018

S. Kravitz, A search for large weird numbers. J. Recreational Math. 9 (1976), 82-85 (1977). Zbl 0365.10003

Douglas E. Iannucci and Robert G. Wilson v, Table of n, a(n) for n = 1..15384, updated Dec 06 2015; corrected by _M. F. Hasler_, Jul 16 2016
R. Bagula et al., A very big weird number, Number Theory group on LinkedIn (web.archive.org snapshot; page no longer available). Dec. 2013
Central Washington University, CWU Math Students Break World Record for Largest Weird Number [alternate article]
Douglas E. Iannucci, On primitive weird numbers of the form 2^k*p*q, arXiv:1504.02761 [math.NT], 2015.
Giuseppe Melfi, On the conditional infiniteness of primitive weird numbers, Journal of Number Theory, Vol. 147, Feb 2015, pp 508-514.
Eric Weisstein's World of Mathematics, Weird Number.
Wikipedia, Weird number

Cf. A002975, A258401 (PWN not of this form), A258374, A258375, A258883, A258884, A258885.
Cf. A242025, A242993, A242998, A242999, A243003 (related to the subsequence with q = (2^k*p-p-1)/(p+1-2^k) and p a Mersenne prime in A000668).
Cf. A320875 (more general case of Karavitz' formula).

(* copy the terms from A002975, assign them equal to 'lst' and then *) fQ[n_] := Block[{m = n}, While[ Mod[m, 2] == 0, m /= 2]; PrimeOmega@ m == 2]; Select[lst, fQ]

select(t->factor(t)[, 2][^1]=[1, 1]~, A002975) \\ Assuming that A002975 is defined as set or vector. - M. F. Hasler, Jul 11 2016

A258882 union A258401 is A002975.

Edited by M. F. Hasler, Jul 11 2016, Nov 20 2018

A141548 Numbers n whose deficiency is 6.

Original entry on oeis.org

7, 15, 52, 315, 592, 1155, 2102272, 815634435

Offset: 1

Vladimir Joseph Stephan Orlovsky, Aug 16 2008

a(9) > 10^12. - Donovan Johnson, Dec 08 2011
a(9) > 10^13. - Giovanni Resta, Mar 29 2013
a(9) > 10^18. - Hiroaki Yamanouchi, Aug 21 2018
For all k in A059242, the number m = 2^(k-1)*(2^k+5) is in this sequence. This yields further terms 2^46*(2^47+5), 2^52*(2^53+5), 2^140*(2^141+5), ... All even terms known so far and the initial 7 = 2^0*(2^1+5) are of this form. All odd terms beyond a(2) are of the form a(n) = a(k)*p*q, k < n. We have proved that there is no further term of this form with the a(k) given so far. - M. F. Hasler, Apr 23 2015
A term n of this sequence multiplied by a prime p not dividing it is abundant if and only if p < sigma(n)/6 = n/3-1. For the even terms 592 and 2102272, there is such a prime near this limit (191 resp. 693571) such that n*p is a primitive weird number, cf. A002975. For a(3)=52, the largest such prime, 11, is already too small. Odd weird numbers do not exist within these limits. - M. F. Hasler, Jul 19 2016
Any term x of this sequence can be combined with any term y of A087167 to satisfy the property (sigma(x)+sigma(y))/(x+y) = 2, which is a necessary (but not sufficient) condition for two numbers to be amicable. - Timothy L. Tiffin, Sep 13 2016

			a(1) = 7, since 2*7 - sigma(7) = 14 - 8 = 6. - _Timothy L. Tiffin_, Sep 13 2016

Gianluca Amato, Maximilian Hasler, Giuseppe Melfi, Maurizio Parton, Primitive weird numbers having more than three distinct prime factors, Riv. Mat. Univ. Parma, 7(1), (2016), 153-163, arXiv:1803.00324 [math.NT], 2018.

Cf. A087485 (odd terms).
Cf. A000203, A033880, A005100; A191363 (deficiency 2), A125246 (deficiency 4), A141548 (deficiency 6), A125247 (deficiency 8), A101223 (deficiency 10), A141549 (deficiency 12), A141550 (deficiency 14), A125248 (deficiency 16), A223608 (deficiency 18), A223607 (deficiency 20).
Cf. A087167 (abundance 6).

[n: n in [1..9*10^6] | (SumOfDivisors(n)-2*n) eq -6]; // Vincenzo Librandi, Sep 14 2016

lst={};Do[If[n==Plus@@Divisors[n]-n+6,AppendTo[lst,n]],{n,10^4}];Print[lst];
Select[Range[1, 10^8], DivisorSigma[1, #] - 2 # == - 6 &] (* Vincenzo Librandi, Sep 14 2016 *)

is(n)=sigma(n)==2*n-6 \\ Charles R Greathouse IV, Apr 23 2015, corrected by M. F. Hasler, Jul 18 2016

a(8) from Donovan Johnson, Dec 08 2011

A125246 Numbers m whose abundance sigma(m) - 2m = -4. Numbers whose deficiency is 4.

Original entry on oeis.org

5, 14, 44, 110, 152, 884, 2144, 8384, 18632, 116624, 8394752, 15370304, 73995392, 536920064, 2147581952, 34360131584, 27034175140420610, 36028797421617152, 576460753914036224

Offset: 1

Jason G. Wurtzel, Nov 25 2006

a(17) > 10^12. - Donovan Johnson, Dec 08 2011
a(17) > 10^13. - Giovanni Resta, Mar 29 2013
a(17) <= b(28) = 36028797421617152 ~ 3.6*10^16, since b(k) := 2^(k-1)*(2^k+3) is in this sequence for all k in A057732, i.e., whenever 2^k+3 is prime, and 28 = A057732(11). Further terms of this form are b(30), b(55), b(67), b(84), ... The only terms not of the form b(k), below 10^13, are {110, 884, 18632, 116624, 15370304, 73995392}. - M. F. Hasler, Apr 27 2015, edited on Jul 17 2016
See A191363 for numbers with deficiency 2, and A141548 for numbers with deficiency 6. - M. F. Hasler, Jun 29 2016 and Jul 17 2016
A term of this sequence multiplied with a prime p not dividing it is abundant if and only if p < sigma(a(n))/4. For each of a(2..16) there is such a prime, near this limit, such that a(n)*p is a primitive weird number, cf. A002975. - M. F. Hasler, Jul 17 2016
Any term x of this sequence can be combined with any term y of A088832 to satisfy the property (sigma(x)+sigma(y))/(x+y) = 2, which is a necessary (but not sufficient) condition for two numbers to be amicable. - Timothy L. Tiffin, Sep 13 2016
Is 5 the only odd number in this sequence? Is it possible to prove this? - M. F. Hasler, Feb 22 2017
a(20) > 10^18. - Hiroaki Yamanouchi, Aug 21 2018
If m is an even term, then (m-2)/2 is a term of A067680. - Jinyuan Wang, Apr 08 2020
This sequence also includes 560355448016825045579988992 (2^27 * 273235673 * 15279752393), 32693238205141285305936250223747333759271379959906566144 (2^46 * 140737488355333 * 3301173438094464680971294037), and 6973609605646930650581983850870750514589690385597438439074774331167388729344 (2^72 * 9444732966309810734197 * 156353734889656660519256754097637). - Alexander Violette, Aug 29 2025

			The abundance of 5 = (1+5)-10 = -4.
More generally, whenever p = 2^k + 3 is prime (as p = 5 for k = 1), then A(2^(k-1)*p) = (2^k-1)*(p+1) - 2^k*p = 2^k - p - 1 = -4.

Cf. A033880, A057732, A067680, A191363, A141548, A125247, A125248, A088832 (abundance 4).

[n: n in [1..9*10^6] | (SumOfDivisors(n)-2*n) eq -4]; // Vincenzo Librandi, Sep 15 2016

Select[Range[10^7], DivisorSigma[1, #] - 2 # == -4 &] (* Michael De Vlieger, Jul 18 2016 *)

PARI
```
isok(n) = ((sigma(n)-2*n)==-4);
```

a(11) to a(14) from Klaus Brockhaus, Nov 29 2006
a(15)-a(16) from Donovan Johnson, Dec 23 2008
a(17)-a(19) from Hiroaki Yamanouchi, Aug 21 2018

A125247 Numbers n whose abundance sigma(n) - 2n = -8. Numbers n whose deficiency is 8.

Original entry on oeis.org

22, 130, 184, 1012, 2272, 18904, 33664, 70564, 85936, 100804, 391612, 527872, 1090912, 17619844, 2147713024, 6800695312, 34360655872, 549759483904, 1661355408388, 28502765343364, 82994670582016, 99249696661504, 120646991405056, 431202442356004, 952413274955776

Offset: 1

Jason G. Wurtzel, Nov 25 2006

a(19) > 10^12. - Donovan Johnson, Dec 08 2011
a(20) > 10^13. - Giovanni Resta, Mar 29 2013
a(30) > 10^18. - Hiroaki Yamanouchi, Aug 21 2018
a(20) <= 36028797958488064 ~ 3.6*10^16. Indeed, if k is in A057195 then 2^(k-1)*A168415(k) is in this sequence, and k=28 yields this upper bound for a(20) which is in any case a term of this sequence. - M. F. Hasler, Apr 27 2015
If n is in this sequence and p a prime not dividing n, then np is abundant if and only if p < sigma(n)/8 = n/4-1. For all n=a(k) except {22, 70564, 100804, 17619844}, there is such a p near this limit, such that n*p is a primitive weird number (A002975; in A258882 for the terms mentioned in the preceding comment). - M. F. Hasler, Jul 20 2016
Any term x of this sequence can be combined with any term y of A088833 to satisfy the property (sigma(x)+sigma(y))/(x+y) = 2, which is a necessary (but not sufficient) condition for two numbers to be amicable. - Timothy L. Tiffin, Sep 13 2016
Is there any odd number in this sequence? Is it possible to prove the contrary? - M. F. Hasler, Feb 22 2017

			The abundance of 22 = (1+2+11+22)-44 = -8

Hiroaki Yamanouchi, Table of n, a(n) for n = 1..29

Cf. A033880, A088833 (abundance 8).

[n: n in [1..2*10^7] | (DivisorSigma(1,n)-2*n) eq - 8]; // Vincenzo Librandi, Jul 22 2016

Select[Range[10^6], DivisorSigma[1, #] - 2 # == -8 &] (* Michael De Vlieger, Jul 21 2016 *)

for(n=1,1000000,if(((sigma(n)-2*n)==-8),print1(n,",")))

a(13)-a(15) from Klaus Brockhaus, Nov 29 2006
a(16)-a(17) from Donovan Johnson, Dec 23 2008
a(18) from Donovan Johnson, Dec 08 2011
a(19) from Giovanni Resta, Mar 29 2013
a(20)-a(25) from Hiroaki Yamanouchi, Aug 21 2018

A191363 Numbers m such that sigma(m) = 2*m - 2.

Original entry on oeis.org

3, 10, 136, 32896, 2147516416

Offset: 1

Luis H. Gallardo, May 31 2011

Let k be a nonnegative integer such that F(k) = 2^(2^k) + 1 is prime (a Fermat prime A019434), then m = (F(k)-1)*F(k)/2 appears in the sequence.
Conjecture: a(1)=3 is the only odd term of the sequence.
Conjecture: All terms of the sequence are of the above form derived from Fermat primes.
The sequence has 5 (known) terms in common with sequences A055708 (k-1 | sigma(k)) and A056006 (k | sigma(k)+2) since {a(n)} is a subsequence of both.
The first five terms of the sequence are respectively congruent to 3, 4, 4, 4, 4 modulo 6.
After a(5) there are no further terms < 8*10^9.
Up to m = 1312*10^8 there are no further terms in the class congruent to 4 modulo 6.
a(6) > 10^12. - Donovan Johnson, Dec 08 2011
a(6) > 10^13. - Giovanni Resta, Mar 29 2013
a(6) > 10^18. - Hiroaki Yamanouchi, Aug 21 2018
See A125246 for numbers with deficiency 4, i.e., sigma(m) = 2*m - 4, and A141548 for numbers with deficiency 6. - M. F. Hasler, Jun 29 2016 and Jul 17 2016
A term m of this sequence multiplied by a prime p not dividing it is abundant if and only if p < m-1. For each of a(2..5) there is such a prime near this limit (here: 7, 127, 30197, 2147483647) such that a(k)*p is a primitive weird number, cf. A002975. - M. F. Hasler, Jul 19 2016
Any term m of this sequence can be combined with any term j of A088831 to satisfy the property (sigma(m) + sigma(j))/(m+j) = 2, which is a necessary (but not sufficient) condition for two numbers to be amicable. [Proof: If m = a(n) and j = A088831(k), then sigma(m) = 2m-2 and sigma(j) = 2j+2. Thus, sigma(m) + sigma(j) = (2m-2) + (2j+2) = 2m + 2j = 2(m+j), which implies that (sigma(m) + sigma(j))/(m+j) = 2(m+j)/(m+j) = 2.] - Timothy L. Tiffin, Sep 13 2016
At least the first five terms are a subsequence of A295296 and of A295298. - David A. Corneth, Antti Karttunen, Nov 26 2017
Conjectures: all terms are second hexagonal numbers (A014105). There are no terms with middle divisors. - Omar E. Pol, Oct 31 2018
The symmetric representation of sigma(m) of each of the 5 numbers in the sequence consists of 2 parts of width 1 that meet at the diagonal (subsequence of A246955). - Hartmut F. W. Hoft, Mar 04 2022
The first five terms coincide with the sum of two successive terms of A058891. The same is not true for a(6), if such exists. - Omar E. Pol, Mar 03 2023

			For n=1, a(1) = 3 since sigma(3) = 4 = 2*3 - 2.

Gianluca Amato, Maximilian Hasler, Giuseppe Melfi, and Maurizio Parton, Primitive weird numbers having more than three distinct prime factors, Riv. Mat. Univ. Parma, 7(1), (2016), 153-163, arXiv:1803.00324 [math.NT], 2018.

Cf. A000203, A002975, A056006, A055708, A088831 (abundance 2).
Cf. A033880, A125246 (deficiency 4), A141548 (deficiency 6), A125247 (deficiency 8), A125248 (deficiency 16).
Cf. A295296, A295298.
Cf. A014105, A237593, A246955.
Cf. A058891.

[n: n in [1..9*10^6] | (SumOfDivisors(n)-2*n) eq -2]; // Vincenzo Librandi, Sep 15 2016

ok[n_] := DivisorSigma[1,n] == 2*n-2; Select[ Table[ 2^(2^k-1) * (2^(2^k)+1), {k, 0, 5}], ok] (* Jean-François Alcover, Sep 14 2011, after conjecture *)
Select[Range[10^6], DivisorSigma[1, #] == 2 # - 2 &] (* Michael De Vlieger, Sep 14 2016 *)

zp(a,b) = {my(c,c1,s); c = a; c1 = 2*c-2;
while(c

a(k)=(2^2^k+1)<<(2^k-1) \\ For k<6. - M. F. Hasler, Jul 27 2016

a(n) = (A019434(n)-1)*A019434(n)/2 for all terms known so far. - M. F. Hasler, Jun 29 2016

A258883 Primitive weird numbers (PWN) of the form 2^kpq*r with k > 0 and where p < q < r are odd primes.

Original entry on oeis.org

4030, 5830, 45356, 91388, 243892, 254012, 338572, 343876, 388076, 1713592, 8812312, 9928792, 11339816, 11547352, 15126992, 17999992, 29581424, 38546576, 74899952, 85389368, 89283592, 95327216, 141659096, 146764264, 162079768, 173482552, 569494624, 632874016

Offset: 1

Douglas E. Iannucci and Robert G. Wilson v, Jun 14 2015

nonn

The condition k > 0 is not really a limitation since a product of three odd primes cannot be weird. -- Numbers of the form 2^k*p^2*q having only two distinct odd prime divisors, e.g., A258401(45) = 2319548096 = 2^6 * 137^2 * 1931 or A258401(143) = 232374697216 = 2^8 * 797^2 * 1429, are neither in A258882 nor in the present sequence as it is currently defined, although they are in the set of weird numbers 2^k*p*q*r with odd primes p,q,r. (PWN with nonsquarefree odd part are listed in A273815.) - M. F. Hasler, Jul 18 2016, amended Nov 09 2017

It appears that there are (2, 7, 12, 18, 41, ...) terms with k = valuation(a(n),2) = 1, 2, 3, etc. The smallest and largest such are (4030, 45356, 1713592, 15126992, 569494624, 5353519168, 96743686016, 1009572479744, ...) resp. (5830, 388076, 173482552, 6587973136, 297512429728, ...). - M. F. Hasler, Nov 09 2017

			a(1) = 4030 = 2*5*13*31.
a(2) = 5830 = 2*5*11*53.
a(3) = 45356 = 2^2*17*23*29.

M. F. Hasler, Table of n, a(n) for n = 1..121 (Using A002975(1..1073) calculated by _Robert G. Wilson v_.)

Cf. A002975, A258401, A258882, A258884, A258885.

(* copy the terms from A002975, assign them to 'lst' and then *) Select[ lst, PrimeNu@# == 4 &] (* WARNING: this code selects PWN with 3 distinct odd prime factors but does not exclude that they occur with multiplicity > 1, which is forbidden by definition of this sequence. - M. F. Hasler, Jul 12 2016 *)

select(w->factor(w)[,2][^1]~==[1,1,1], A002975) \\ Assuming that A002975 is defined as set or vector. - M. F. Hasler, Jul 12 2016

A258884 Primitive weird numbers, pwn, of the form 2^kpqrs with k > 0 and where p < q < r < s are odd primes.

Original entry on oeis.org

4199030, 29465852, 120888092, 259858324, 260378492, 410832532, 775397948, 785187524, 903217276, 989226964, 1609445332, 2358115084, 3254323124, 3381352084, 3381872252, 3781448788, 3782267372, 5056717796, 5065605532, 5066413508, 9210347984, 9772585048, 9776437996, 9843119884

Offset: 1

Douglas E. Iannucci and Robert G. Wilson v, Jun 14 2015

nonn

This differs from the sequence of primitive weird numbers with 5 (or 4 odd) distinct prime factors from a(54) on, the 54th number of that form being 114141404156 = 2^2 * 13^2 * 19 * 383 * 23203. - M. F. Hasler, Jul 08 2016

			a(1) = 4199030 = 2*5*11*59*647.
a(2) = 29465852 = 2^2*13*23*71*347.
a(3) = 120888092 = 2^2*13*23*61*1657.

M. F. Hasler, Table of n, a(n) for n = 1..60

Cf. A002975, A258401, A258882, A258883, A258885.

select(t -> factor(t)[,2][^1]~ == [1,1,1,1], A002975) \\ Assuming that A002975 is defined as vector holding enough terms of that sequence. - M. F. Hasler, Jul 08 2016

Definition edited (to require p > 2) by M. F. Hasler, Jul 08 2016

Incorrect Mathematica code (allowed 114141404156) removed by M. F. Hasler, Jun 29 2016

A258333 Number of (primitive) weird numbers of the form 2^npq, with odd primes p < q.

Original entry on oeis.org

1, 1, 5, 3, 10, 23, 29, 53, 115, 210, 394, 683, 1389, 3118, 6507, 9120

Offset: 1

Douglas E. Iannucci and Robert G. Wilson v, May 27 2015

Sequence taken from page 3 of "On primitive weird numbers of the form 2^k*p*q".
The (primitive) weird numbers considered here are listed in A258882, a proper subset of A002975.
If 2^k*p*q is weird, then 2^(k+1) < p < 2^(k+2)-2 < q < 2^(2k+1).
This being the case the number of possible pwn of the form 2^n*p*q with p unique is: 1, 2, 4, 7, 12, 23, 43, 75, 137, 255, 463, 872, 1612, 3030, 5708, ....
However, p is usually not unique, e.g., for k=3, p=19 we have two pwn (with q=61 and q=71), and for k=5, p=71 yields two pwn (for q=523 and q=541) and p=67 yields three pwn (for q=887, 971 and 1021). I conjecture that there is an increasing number of pwn with, e.g., p=nextprime(2^(k+1)). Also, if 2^k p q and 2^k p' q are both weird, then usually 2^k p" q is weird for all p" between p and p'. There is one exception [p, p', q] = [2713, 2729, 8191] for k=10, five exceptions [6197, 6203, 12049], [6113, 6131, 12289], [6113, 6131, 12301], [6121, 6133, 12323], [5441, 5449, 16411] for k=11, and seven exceptions for k=12. These exceptions occur when q/p is close to an integer, (p, q) ~ (3/4, 3/2)*2^(k+2) or (2/3, 2)*2^(k+2). - M. F. Hasler, Jul 16 2016

			The only primitive weird number of the form 2*p*q is 70 so a(1) = 1;
The only primitive weird number of the form 2^2*p*q is 836 so a(2) = 1;
There are 5 primitive weird numbers of the form 2^3*p*q and they are 5704, 7912, 9272, 10792 & 17272; so a(3) = 5; etc.

Douglas E. Iannucci, On primitive weird numbers of the form 2^k*p*q, arXiv:1504.02761 [math.NT], 2015.

Cf. A002975, A258882.

A258333(n)={ local(s=0,p,M=2^(n+1)-1,qn,T(P=p-1)=is_A006037(qn*p=precprime(P)) && s+=1); forprime(q=2*M,M*(M+1), qn=q<M, T() || T() || break)); s} \\ Not very efficient, for illustrative purpose only. - M. F. Hasler, Jul 18 2016

a(15) from Robert G. Wilson v, Jun 14 2015

a(16) from Robert G. Wilson v, Dec 06 2015

cp's OEIS Frontend

A322524 Primitive weird numbers (pwn; A002975) divisible by 4 but not 8.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A006037 Weird numbers: abundant (A005101) but not pseudoperfect (A005835).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

PARI

PARI

Extensions

A258882 Primitive weird numbers of the form 2^k*p*q with k > 0 and where p < q are odd primes.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A141548 Numbers n whose deficiency is 6.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Extensions

A125246 Numbers m whose abundance sigma(m) - 2m = -4. Numbers whose deficiency is 4.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Magma

Mathematica

PARI

Extensions

A125247 Numbers n whose abundance sigma(n) - 2n = -8. Numbers n whose deficiency is 8.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Extensions

A191363 Numbers m such that sigma(m) = 2*m - 2.

Views

Author

A258882 Primitive weird numbers of the form 2^kpq with k > 0 and where p < q are odd primes.

A258883 Primitive weird numbers (PWN) of the form 2^kpq*r with k > 0 and where p < q < r are odd primes.

A258884 Primitive weird numbers, pwn, of the form 2^kpqrs with k > 0 and where p < q < r < s are odd primes.

A258333 Number of (primitive) weird numbers of the form 2^npq, with odd primes p < q.