A287728 -id:A287728 - cp's OEIS frontend

A337372 Primitively primeshift-abundant numbers: Numbers that are included in A246282 (k with A003961(k) > 2k), but none of whose proper divisors are.

4, 6, 9, 10, 14, 15, 21, 35, 39, 49, 57, 69, 91, 125, 242, 275, 286, 325, 338, 363, 418, 425, 442, 475, 494, 506, 561, 575, 598, 646, 682, 715, 722, 725, 754, 775, 782, 806, 845, 847, 867, 874, 925, 957, 962, 1023, 1025, 1045, 1054, 1058, 1066, 1075, 1105, 1118, 1175, 1178, 1221, 1222, 1235, 1265, 1309, 1325, 1334, 1353

Offset: 1

Antti Karttunen, Aug 27 2020

nonn

Numbers k whose only divisor in A246282 is k itself, i.e., A003961(k) > 2k, but for none of the proper divisors d|k, dA003961(d) > 2d.
Question: Do the odd terms in A326134 all occur here? Answer is yes, if the following conjecture holds: This is a subsequence of A263837, nonabundant numbers. In other words, we claim that any abundant number k (A005101) has A337345(k) > 1 and thus is a term of A341610. (The conjecture indeed holds. See the proof below).
From Antti Karttunen, Dec 06 2024: (Start)
Observation 1: The thirteen initial terms (4, 6, 9, ..., 69, 91) are only semiprimes in A246282, all other semiprimes being in A246281 (but none in A341610), and there seems to be only 678 terms m with A001222(m) = 3, from a(14) = 125 to the last one of them, a(2691) = 519963. There are more than 150000 terms m with A001222(m) = 4. In general, there should be only a finite number of terms m for any given k = A001222(m). Compare for example with A287728.
Observation 2: The intersection with A005101 (and thus also with A091191) is empty, which then implies the claims made in the sequences A378662, A378664, from which further follows that there are no 1's present in any of these sequences: A378658, A378736, A378740.
(End)
Proof of the latter observation by Jianing Song, Dec 11 2024: (Start)
Let's write p' for the next prime after the prime p. Also, write Q(n) = A003961(n)/sigma(n) which is multiplicative.
Proposition: For n > 1 not being a prime nor twice a prime, n has a factor p such that Q(n) > p'/p.
This implies that if n is abundant [including any primitively abundant n in A091191], then n has a factor p such that A003961(n/p)/(n/p) = (A003961(n)/n)/(p'/p) > sigma(n)/n [which is > 2 because n is abundant], so n/p is in A246282, meaning that n cannot be in this sequence.
Proof. We see that 1 <= Q(p) <= Q(p^2) <= ..., which implies that if n verifies the proposition, then every multiple of n also verifies it. Since n = p^2 > 4 and n = 8 verify the proposition, it suffices to consider the case where n = pq is the product of two distinct odd primes. Suppose WLOG that p < q, so q >= p', then using q/(q+1) >= p'/(p'+1) we have
Q(n) = p'q'/((p+1)(q+1)) >= p'^2*q'/(q(p+1)(p'+1)) > (p'^2-1)*q'/(q(p+1)(p'+1)) = (p'-1)/(p+1) * q'/q >= q'/q.
(End)

			14 = 2*7 is in the sequence as setting every prime to the next larger prime gives 3*11 = 33 > 28 = 2*14. Doing so for any proper divisor d of 14 gives a number < 2 * d. - _David A. Corneth_, Dec 07 2024

Antti Karttunen, Table of n, a(n) for n = 1..20000
David A. Corneth, PARI programs
Index entries for sequences related to prime indices in the factorization of n.
Index entries for primes, gaps between.

Setwise difference A246282 \ A341610.
Cf. A000101, A003961, A246281, A252742, A337346, A378745, A378746.
Cf. A378658, A378662, A378664, A378736, A378740.
Positions of ones in A337345 and in A341609 (characteristic function).
Subsequence of A263837 and thus also of A341614.
Cf. also A005101, A091191, A326134.
Cf. also A337543.

Block[{a = {}, b = {}}, Do[If[2 i < Times @@ Map[#1^#2 & @@ # &, FactorInteger[i] /. {p_, e_} /; e > 0 :> {Prime[PrimePi@ p + 1], e}] - Boole[i == 1], AppendTo[a, i]; If[IntersectingQ[Most@ Divisors[i], a], AppendTo[b, i]]], {i, 1400}]; Complement[a, b]] (* Michael De Vlieger, Feb 22 2021 *)

A003961(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
A252742(n) = (A003961(n) > (2*n));
A337346(n) = sumdiv(n,d,(dA252742(d));
isA337372(n) = ((1==A252742(n))&&(0==A337346(n)));

PARI
```
is_A337372 = A341609;
```
PARI
```
\\ See Corneth link
```

{k: 1==A337345(k)}.

A287646 Irregular triangle read by rows where row n lists all odd primitive abundant numbers with n prime factors, counted with multiplicity.

Original entry on oeis.org

945, 1575, 2205, 3465, 4095, 5355, 5775, 5985, 6435, 6825, 7245, 8085, 8415, 8925, 9135, 9555, 9765, 11655, 12705, 12915, 13545, 14805, 15015, 16695, 18585, 19215, 19635, 21105, 21945, 22365, 22995, 23205, 24885, 25935, 26145, 26565, 28035, 30555, 31395, 31815, 32445, 33495

Offset: 5

M. F. Hasler, May 30 2017

This triangle is the analog of A188439 for A001222 ("bigomega", total number of prime factors) instead of A001221 ("omega", distinct prime divisors). It starts with row 5, since there is no odd primitive abundant number, N in A006038, with less than A001222(N) = 5 prime factors (counted with multiplicity).
Sequence A287728 gives the row lengths: Row 5 has 121 terms (945, 1575, 2205, 3465, 4095, ..., 430815, 437745, 442365). This mostly equals the initial terms of A006038, except for those with indices {12, 39, 40, 45, 48, 54, ..., 87}. These are in turn mostly (except for the 17th and 18th term) those of the subsequent row 6 which has 15772 terms, (7425, 28215, 29835, 33345, 34155, ..., 13443355695, 13446051465, 13455037365).
Sequences A275449 and A287581 give the smallest and largest* element of each row (*assuming that the largest term in the row is squarefree). Accordingly, row 7 starts with A275449(7) = 81081, and ends with A287581(7) = 1725553747427327895.

Cf. A188439, A001222, A006038, A287728, A275449, A287581, A338133.

A287646_row( r, p=3, a=2, n=1/(a-1))={ r>1 || return(if(n>=p, primes([p,n]))); p(p-1)*a && p-1/p^(r-1)<(p-1)*a,[p^r],[]),ap=1,np=nextprime(p+1)); until( 0, if( (1+1/np)^(r-e) > (aa = a/ap += 1/p^e) && aa > 1, if(n=A287646_row(r-e,np,aa), if(e>1, my(aaa=a/(ap-1/p^e)); n=select(t->sigma(t,-1)1 || n || break; np=nextprime((e=ap=1)+p=np)); S}

A298157 Number of primitive abundant numbers (A071395) with n prime factors, counted with multiplicity.

Original entry on oeis.org

0, 0, 2, 25, 906, 265602, 13232731828

Offset: 1

Gianluca Amato, Feb 15 2018

This uses the first definition of primitive abundant numbers, A071395: having only deficient proper divisors. The second definition (A091191: having no abundant proper divisors) would yield infinite a(3), since all numbers 6*p, p > 3, are in that sequence.
See A287728 for the number of ODD primitive abundant numbers with n prime factors, counted with multiplicity and A295369 for the number of squarefree primitive abundant numbers with n distinct prime factors.
It appears that a(n) is just slightly larger than A295369(n).

			For n=3, the only two primitive abundant numbers (PAN) are 2*2*5 = 20 and 2*5*7 = 70. The latter is also a primitive weird number, see A002975.
For n=4, the 25 PAN range from 2^3*11 = 88 to 2*5*11*53 = 5830.

G. Amato, Primitive Weirds and Abundant Numbers, GitHub.
Gianluca Amato, Maximilian F. Hasler, Giuseppe Melfi, Maurizio Parton, Primitive abundant and weird numbers with many prime factors, arXiv:1802.07178 [math.NT], 2018.

Cf. A071395 (primitive abundant numbers), A091191 (alternative definition), A287728 (counts of odd PAN), A295369 (counts of squarefree PAN).

SageMath
```
# See GitHub link.
```

cp's OEIS Frontend

A337372 Primitively primeshift-abundant numbers: Numbers that are included in A246282 (k with A003961(k) > 2k), but none of whose proper divisors are.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

PARI

Formula

A287646 Irregular triangle read by rows where row n lists all odd primitive abundant numbers with n prime factors, counted with multiplicity.

Views

Author

Keywords

Comments

Crossrefs

Programs

PARI

A298157 Number of primitive abundant numbers (A071395) with n prime factors, counted with multiplicity.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

SageMath