A373845 -id:A373845 - cp's OEIS frontend

A373848 Numbers k such that k is 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

Antti Karttunen, Jun 20 2024

nonn

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.

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

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.

\\ Uses the code from A373842, or its precomputed data:
A359550(n) = { my(f = factor(n)); prod(k=1, #f~, (f[k, 2]A373848(n) = if(!A359550(n), 0, my(u=A373842(n)); ((1

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

A373844 Triangle read by rows: T(n,k) = A276086(1 + A002110(n) + A002110(k)), 1 <= k <= n, where A276086 is the primorial base exp-function.

Original entry on oeis.org

18, 30, 50, 42, 70, 98, 66, 110, 154, 242, 78, 130, 182, 286, 338, 102, 170, 238, 374, 442, 578, 114, 190, 266, 418, 494, 646, 722, 138, 230, 322, 506, 598, 782, 874, 1058, 174, 290, 406, 638, 754, 986, 1102, 1334, 1682, 186, 310, 434, 682, 806, 1054, 1178, 1426, 1798, 1922, 222, 370, 518, 814, 962, 1258, 1406, 1702, 2146, 2294, 2738

Offset: 1

Antti Karttunen, Jun 21 2024

Triangle giving all products of three primes, of which one is even (2) and two are odd (not necessarily distinct), so that the product is of the form 4m+2.

The only terms such that T(n, k) > A373845(n, k) > 1 are 30, 42, 110 at positions T(2,1), T(3,1), T(4,2), and the corresponding terms in A373845 are 6, 14, 38.

			Triangle begins as:
   18,
   30,  50,
   42,  70,  98,
   66, 110, 154, 242,
   78, 130, 182, 286, 338,
  102, 170, 238, 374, 442,  578,
  114, 190, 266, 418, 494,  646,  722,
  138, 230, 322, 506, 598,  782,  874, 1058,
  174, 290, 406, 638, 754,  986, 1102, 1334, 1682,
  186, 310, 434, 682, 806, 1054, 1178, 1426, 1798, 1922,
  222, 370, 518, 814, 962, 1258, 1406, 1702, 2146, 2294, 2738,
etc.

Antti Karttunen, Table of n, a(n) for n = 1..10585; the first 145 rows of the triangle

Cf. A002110, A276086, A370121, A373845.

Cf. also A087112, A369979, A373848.

A002110(n) = prod(i=1,n,prime(i));
A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
A373844(n) = { n--; my(c = (sqrtint(8*n + 1) - 1) \ 2, x=A002110(1+n - binomial(c + 1, 2))); A276086(1+(A002110(1+c)+x)); };

For n, k >= 1, T(n, k) = A276086(1+A370121(n, k)).

For n, k >= 1, T(n, k) = 2*A087112(n+1, k+1).

cp's OEIS Frontend

A373848 Numbers k such that k is 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.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

PARI

A373844 Triangle read by rows: T(n,k) = A276086(1 + A002110(n) + A002110(k)), 1 <= k <= n, where A276086 is the primorial base exp-function.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula