A328242 -id:A328242 - cp's OEIS frontend

A327860 Arithmetic derivative of the primorial base exp-function: a(n) = A003415(A276086(n)).

0, 1, 1, 5, 6, 21, 1, 7, 8, 31, 39, 123, 10, 45, 55, 185, 240, 705, 75, 275, 350, 1075, 1425, 3975, 500, 1625, 2125, 6125, 8250, 22125, 1, 9, 10, 41, 51, 165, 12, 59, 71, 247, 318, 951, 95, 365, 460, 1445, 1905, 5385, 650, 2175, 2825, 8275, 11100, 30075, 4125, 12625, 16750, 46625, 63375, 166125, 14, 77, 91, 329, 420

Offset: 0

Antti Karttunen, Sep 30 2019

Are there any other fixed points after 0, 1, 7, 8 and 2556? (A328110, see also A351087 and A351088).
Out of the 30030 initial terms, 19220 are multiples of 5. (See A327865).
Proof that a(n) is even if and only if n is a multiple of 4: Consider Charlie Neder's Feb 25 2019 comment in A235992. As A276086 is never a multiple of 4, and as it toggles the parity, we only need to know when A001222(A276086(n)) = A276150(n) is even. The condition for that is given in the latter sequence by David A. Corneth's Feb 27 2019 comment. From this it also follows that A166486 gives similarly the parity of terms of A342002, A351083 and A345000. See also comment in A327858. - Antti Karttunen, May 01 2022

			2556 has primorial base expansion [1,1,1,1,0,0] as 1*A002110(5) + 1*A002110(4) + 1*A002110(3) + 1*A002110(2) = 2310 + 210 + 30 + 6 = 2556. That in turn is converted by A276086 to 13^1 * 11^1 * 7^1 * 5^1 = 5005, whose arithmetic derivative is 5' * 1001 + 1001' * 5 = 1*1001 + 311*5 = 2556, thus 2556 is one of the rare fixed points (A328110) of this sequence.

Antti Karttunen, Table of n, a(n) for n = 0..2310
Antti Karttunen, Data supplement: n, a(n) computed for n = 0..30030
Index entries for sequences related to primorial base

Cf. A002110 (positions of 1's), A003415, A048103, A276086, A327858, A327859, A327865, A328110 (fixed points), A328233 (positions of primes), A328242 (positions of squarefree terms), A328388, A328392, A328571, A328572, A329031, A329032, A329041, A342002.
Cf. A345000, A351074, A351075, A351076, A351077, A351080, A351083, A351084, A351087 (numbers k such that a(k) is a multiple of k), A351088.
Coincides with A329029 on positions given by A276156.
Cf. A166486 (a(n) mod 2), A353630 (a(n) mod 4).
Cf. A267263, A276150, A324650, A324653, A324655 for omega, bigomega, phi, sigma and tau applied to A276086(n).
Cf. also A351950 (analogous sequence).

Block[{b = MixedRadix[Reverse@ Prime@ Range@ 12]}, Array[Function[k, If[# < 2, 0, # Total[#2/#1 & @@@ FactorInteger[#]] ] &@ Abs[Times @@ Power @@@ # &@ Transpose@{Prime@ Range@ Length@ k, Reverse@ k}]]@ IntegerDigits[#, b] &, 65, 0]] (* Michael De Vlieger, Mar 12 2021 *)

A003415(n) = {my(fac); if(n<1, 0, fac=factor(n); sum(i=1, matsize(fac)[1], n*fac[i, 2]/fac[i, 1]))}; \\ From A003415
A276086(n) = { my(i=0,m=1,pr=1,nextpr); while((n>0),i=i+1; nextpr = prime(i)*pr; if((n%nextpr),m*=(prime(i)^((n%nextpr)/pr));n-=(n%nextpr));pr=nextpr); m; };
A327860(n) = A003415(A276086(n));

A327860(n) = { my(s=0, m=1, p=2, e); while(n, e = (n%p); m *= (p^e); s += (e/p); n = n\p; p = nextprime(1+p)); (s*m); }; \\ (Standalone version) - Antti Karttunen, Nov 07 2019

a(n) = A003415(A276086(n)).
a(A002110(n)) = 1 for all n >= 0.
From Antti Karttunen, Nov 03 2019: (Start)
Whenever A329041(x,y) = 1, a(x + y) = A003415(A276086(x)*A276086(y)) = a(x)*A276086(y) + a(y)*A276086(x). For example, we have:
a(n) = a(A328841(n)+A328842(n)) = A329031(n)*A328572(n) + A329032(n)*A328571(n).
A051903(a(n)) = A328391(n).
A328114(a(n)) = A328392(n).
(End)
From Antti Karttunen, May 01 2022: (Start)
a(n) = A328572(n) * A342002(n).
For all n >= 0, A000035(a(n)) = A166486(n). [See comments]
(End)

Verbal description added to the definition by Antti Karttunen, May 01 2022

A328234 Numbers whose arithmetic derivative (A003415) is a squarefree number (A005117) > 1.

Original entry on oeis.org

6, 9, 10, 18, 21, 22, 25, 26, 30, 33, 34, 38, 42, 45, 49, 57, 58, 62, 63, 66, 69, 70, 74, 75, 78, 82, 85, 90, 93, 98, 102, 105, 106, 110, 114, 117, 118, 121, 126, 129, 130, 133, 134, 142, 145, 147, 150, 153, 154, 161, 165, 166, 169, 170, 171, 174, 175, 177, 178, 182, 185, 186, 190, 195, 198, 201, 202, 205, 206, 209, 210, 213

Offset: 1

Antti Karttunen, Oct 10 2019

nonn

Sequence A328393 without primes.
No multiples of 4 because this is a subsequence of A048103.
All terms are cubefree, but being a cubefree non-multiple of 4 doesn't guarantee a membership, as for example 99 = 3^2 * 11 has an arithmetic derivative 11*(2*3) + 3^2 = 75 = 5^2 * 3, and thus is not included in this sequence. (See e.g., A328305).

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

Cf. A003415, A005117, A068328, A068719, A235991, A327862, A328239, A328242, A328244, A328245, A328246, A328247.
Cf. A328252 (nonsquarefree terms), A157037, A192192, A327978 (other subsequences).
Subsequence of following sequences: A004709, A048103, A328393.
Complement of the union of A000040 and A328303, i.e., complement of A328303, but without primes.
Cf. also A328248, A328250, A328305.

arthD[n_]:=Module[{fi=FactorInteger[n]},n Total[(fi[[;;,2]]/fi[[;;,1]])]]; Select[Range[300],arthD[#]>1&&SquareFreeQ[arthD[#]]&] (* Harvey P. Dale, Dec 01 2024 *)

A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
isA328234(n) = { my(u=A003415(n)); (u>1 && issquarefree(u)); };

A328233 Numbers n such that the arithmetic derivative of A276086(n) is prime.

Original entry on oeis.org

3, 7, 9, 33, 37, 38, 211, 213, 218, 241, 242, 246, 247, 249, 2313, 2317, 2319, 2341, 2342, 2346, 2521, 2523, 2526, 2529, 2550, 2553, 2559, 30031, 30038, 30039, 30061, 30062, 30063, 30066, 30069, 30242, 30243, 30249, 30270, 30278, 30279, 32341, 32342, 32347, 32370, 32373, 32377, 32379, 32551, 32553, 510513, 510518, 510519

Offset: 1

Antti Karttunen, Oct 09 2019

nonn

Numbers n for which A327860(n) = A003415(A276086(n)) is a prime.
Numbers n such that A276086(n) is in A157037.
Terms come in distinct "batches", where in each batch they are "slightly more" than the nearest primorial (A002110) below. This is explained by the fact that for A276086(n) to be a squarefree (which is the necessary condition for A157037), n's primorial base expansion (A049345) must not contain digits larger than 1. Thus this is a subsequence of A276156.
Numbers n such that A327860(A276086(n)) = A003415(A276087(n)) is a prime [A276087(n) is in A157037] are much rarer: 2, 4, 30, 212, 421, 30045, 510511, 512820, 9729723, ...
For all terms k in this sequence, A327969(k) <= 4, and particularly A327969(k) = 2 when k is a prime. Otherwise, when k is not a prime, but A003415(k) is, A327969(k) = 3, while for other cases (when k is neither prime nor in A157037), we have A327969(k) = 4.

Antti Karttunen, Table of n, a(n) for n = 1..269
Index entries for sequences related to primorial base

Cf. A002110, A003415, A051674, A157037, A276086, A327860, A327969, A327978, A328232, A328240.

Subsequence of A276156, of A328116, and of A328242.

A327860(n) = { my(m=1, i=0, s=0, pr=1, nextpr); while((n>0), i=i+1; nextpr = prime(i)*pr; if((n%nextpr), my(e=((n%nextpr)/pr)); m *= (prime(i)^e); s += (e / prime(i)); n-=(n%nextpr)); pr=nextpr); (s*m); };
isA328233(n) = isprime(A327860(n));

A328240 Numbers k such that the second arithmetic derivative of A276086(k) is prime.

Original entry on oeis.org

4, 12, 32, 35, 40, 46, 47, 65, 67, 68, 71, 73, 74, 76, 220, 221, 225, 226, 227, 250, 256, 257, 276, 283, 284, 420, 421, 425, 426, 436, 486, 489, 494, 2324, 2325, 2352, 2370, 2387, 2525, 2530, 2531, 2555, 2560, 2565, 2566, 2583, 2596, 2734, 2739, 2760, 2765, 2769, 2771, 2773, 2795, 2797, 2798, 2803, 4623, 4627, 4628

Offset: 1

Antti Karttunen, Oct 10 2019

nonn

Numbers k for which A003415(A327860(k)) = A003415(A003415(A276086(k))) is a prime.

Numbers k such that A276086(k) is in A192192, or equally, k such that A327860(k) is in A157037.

Antti Karttunen, Table of n, a(n) for n = 1..1217
Index entries for sequences related to primorial base

Cf. A003415, A157037, A192192, A276086, A327860, A327969, A328233.

Subsequence of A328116 and of A328242.

A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A327860(n) = { my(m=1, i=0, s=0, pr=1, nextpr); while((n>0), i=i+1; nextpr = prime(i)*pr; if((n%nextpr), my(e=((n%nextpr)/pr)); m *= (prime(i)^e); s += (e / prime(i)); n-=(n%nextpr)); pr=nextpr); (s*m); };
isA328240(n) = isprime(A003415(A327860(n)));

For all n, a(A327969(n)) <= 5.

A370132 Numbers with no digit larger than 2 in primorial base, A049345.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 240, 241, 242, 243

Offset: 1

Antti Karttunen, Feb 10 2024

Numbers k for which A328114(k) <= 2.

Numbers k such that A276086(k) is cubefree (in A004709).

Antti Karttunen, Table of n, a(n) for n = 1..13122
Index entries for sequences related to primorial base.

Cf. A004709, A049345, A276086, A328114.
Subsequence of A370133.
Subsequences: A328242, A276156 and its subsequences: A002110, A143293.

q[n_] := Module[{k = n, p = 2, s = {}, r}, While[{k, r} = QuotientRemainder[k, p]; k != 0 || r != 0, AppendTo[s, r]; p = NextPrime[p]]; Count[s, ?(# > 2 &)] == 0]; Select[Range[0, 250], q] (* _Amiram Eldar, Mar 06 2024 *)

ismaxprimobasedigit_at_most(n,k) = { my(s=0, p=2); while(n, if((n%p)>k, return(0)); n = n\p; p = nextprime(1+p)); (1); };
isA370132(n) = ismaxprimobasedigit_at_most(n,2);

A370130 a(n) = A369669(A276086(n)), where A369669 is the greatest common divisor of the first and second arithmetic derivative of n, and A276086 is the primorial base exp-function.

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 3, 1, 1, 16, 1, 5, 5, 5, 5, 5, 5, 100, 25, 25, 175, 25, 25, 1, 3, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 4, 17, 1, 1, 5, 5, 5, 5, 20, 5, 25, 25, 25, 25, 325, 25, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 11, 1, 4, 1, 1, 1, 1, 1, 5, 5, 320, 95, 5, 5, 25, 25, 25, 25, 100, 25, 7, 7, 112, 7, 7, 7, 7, 7, 7, 7, 28

Offset: 0

Antti Karttunen, Feb 10 2024

Antti Karttunen, Table of n, a(n) for n = 0..16384
Index entries for sequences related to primorial base

Cf. A003415, A068346, A085731, A276086, A327860, A328242 (positions of 1's), A370131.

Cf. A000012, A024451, A143293.

A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A369669(n) = { my(d=A003415(n)); gcd(d, A003415(d)); };
A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
A370130(n) = A369669(A276086(n));

a(n) = A369669(A276086(n)).
a(n) = gcd(A327860(n), A370131(n)).
For n >= 1, a(n) = A085731(A327860(n)).

A328241 Numbers n for which A327860(n) = A003415(A276086(n)) is not a squarefree number.

Original entry on oeis.org

0, 8, 13, 16, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 31, 36, 44, 45, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 64, 70, 72, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121

Offset: 1

Antti Karttunen, Oct 10 2019

nonn

Antti Karttunen, Table of n, a(n) for n = 1..20000
Index entries for sequences related to primorial base

Cf. A003415, A008966, A276086, A327860.

Cf. A328242 (complement).

A327860(n) = { my(m=1, i=0, s=0, pr=1, nextpr); while((n>0), i=i+1; nextpr = prime(i)*pr; if((n%nextpr), my(e=((n%nextpr)/pr)); m *= (prime(i)^e); s += (e / prime(i)); n-=(n%nextpr)); pr=nextpr); (s*m); };
isA328241(n) = !issquarefree(A327860(n));

cp's OEIS Frontend

A327860 Arithmetic derivative of the primorial base exp-function: a(n) = A003415(A276086(n)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

Extensions

A328234 Numbers whose arithmetic derivative (A003415) is a squarefree number (A005117) > 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

A328233 Numbers n such that the arithmetic derivative of A276086(n) is prime.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A328240 Numbers k such that the second arithmetic derivative of A276086(k) is prime.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

A370132 Numbers with no digit larger than 2 in primorial base, A049345.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

A370130 a(n) = A369669(A276086(n)), where A369669 is the greatest common divisor of the first and second arithmetic derivative of n, and A276086 is the primorial base exp-function.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A328241 Numbers n for which A327860(n) = A003415(A276086(n)) is not a squarefree number.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI