A373848 Numbers k not divisible by p^p for any prime p, and for which 1 < A373842(k) <= k, where A373842 is the arithmetic derivative of the primorial base log-function.

5, 9, 15, 25, 30, 42, 45, 63, 75, 105, 110, 125, 126, 147, 150, 165, 175, 198, 210, 225, 231, 245, 275, 294, 315, 330, 343, 363, 375, 385, 441, 462, 495, 525, 539, 605, 625, 650, 686, 693, 726, 735, 750, 770, 825, 847, 875, 882, 990, 1029, 1050, 1089, 1125, 1155, 1170, 1190, 1210, 1225, 1250, 1331, 1375, 1386, 1430

Offset

1,1

Comments

The initial 5 is the only prime in this sequence (for a proof, consider Henry Bottomley's Sep 27 2006 formula for A024451), the next three terms 9, 15, 25 are only semiprimes (see A087112 and A370129), and there are 21 terms with three prime factors in total: 30, 42, 45, 63, 75, 105, 110, 125, 147, 165, 175, 231, 245, 275, 343, 363, 385, 539, 605, 847, 1331 (see A369979, A370138 and A373844). In general, there should be only a finite amount of terms x such that A001222(x) = k, for any k >= 1.

It is conjectured that 5 is the only fixed point of A373842, which would imply that x=6 is the only number for which A003415(x) = A276086(x). See A351228.

From Antti Karttunen, Jan 15 2026: (Start)

This is sequence A276086(A391939(.)) sorted into ascending order.

Note how the terms in this sequence seem to be rare, while those in A391939 seem to be common. Compare also to the pair A391938 - A351228.

(End).

Links

Antti Karttunen, Table of n, a(n) for n = 1..1565

Prog

(PARI)
\\ Uses the code from A373842, or its precomputed data:
A359550(n) = { my(f = factor(n)); prod(k=1, #f~, (f[k, 2]<f[k, 1])); };
isA373848(n) = if(!A359550(n), 0, my(u=A373842(n)); ((1<u) && (u<=n)));
(PARI)
A002620(n) = ((n^2)>>2);
A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A276085(n) = { my(f = factor(n)); sum(k=1, #f~, f[k, 2]*prod(i=1, primepi(f[k, 1]-1), prime(i))); };
\\ The following routine checks that n is not a prime larger than five, is in A048103, and in case n is odd, rules out cases that certainly cannot give A373842(n) <= n:
prefilter_for_A373848(n) = if(n < 3 || (isprime(n) && n > 5), 0, my(f=factor(n), k=#f~, lpf=f[1, 1], p=f[k, 1], m=f[k, 2]); for(i=1, k, if(f[i, 2]>=f[i, 1], return(0))); if(2==lpf, return(1)); while(p>lpf, p = precprime(p-1); m *= p; if(m>n, return(0))); (1));
isA373848(n) = if(!prefilter_for_A373848(n), 0, my(x=A276085(n)); if(x>A002620(n), 0, (!isprime(x) && A003415(x)<=n)));

Crossrefs

Intersection of A048103 with the setwise difference A373847\(A373846 U {1, 2}).

Subsequence of A373847.

Cf. A001222, A003415, A024451, A087112, A276085, A276086, A359550, A369979, A370129, A370138, A373842, A373844, A373845.

Cf. also A351228, A373603, A391938, A391939.

Sequence in context: A023498 A256343 A210289 * A062516 A249331 A345953

Adjacent sequences: A373845 A373846 A373847 * A373849 A373850 A373851

Keyword

nonn

Author

Antti Karttunen, Jun 20 2024

Status

approved