A068346 -id:A068346 - cp's OEIS frontend

A327969 The length of a shortest path from n to zero when using the transitions x -> A003415(x) and x -> A276086(x), or -1 if no zero can ever be reached from n.

0, 1, 2, 2, 5, 2, 3, 2, 6, 4, 3, 2, 5, 2, 5, 6, 6, 2, 5, 2, 7, 4, 3, 2

Offset: 0

Antti Karttunen, Oct 07 2019

The terms of this sequence are currently known only up to n=23, with the value of a(24) still being uncertain. For the tentative values of the later terms, see sequence A328324 which gives upper bounds for these terms, many of which are very likely also exact values for them.
As A051903(A003415(n)) >= A051903(n)-1, it means that it takes always at least A051903(n) steps to a prime if iterating solely with A003415.
Some known values and upper bounds from n=24 onward:
a(24) <= 11.
a(25) = 4.
a(26) = 7.
a(27) <= 22.
a(33) = 4.
a(39) = 4.
a(40) = 5.
a(42) = 3.
a(44) <= 10.
a(45) = 5.
a(46) = 5.
a(48) = 9.
a(49) = 6.
a(50) = 6.
a(55) = 7.
a(74) = 5.
a(77) = 6.
a(80) <= 18.
a(111) = 6.
a(112) = 8.
a(125) <= 9.
a(240) = 7.
a(625) <= 10.
a(875) = 8.
From Antti Karttunen, Feb 20 2022: (Start)
a(2556) <= 20.
a(5005) <= 19.
What is the value of a(128), and is A328324(128) well-defined?
When I created this sequence, I conjectured that by applying two simple arithmetic operations "arithmetic derivative" (A003415) and "primorial base exp-function" (A276086) in some combination, and starting from any positive integer, we could always reach zero (via a prime and 1).
At the first sight it seems almost certain that the conjecture holds, as it is always possible at every step to choose from two options (which very rarely meet, see A351088), leading to an exponentially growing search tree, and also because A276086 always jumps out of any dead-end path with p^p-factors (dead-end from the arithmetic derivative's point of view). However, it should be realized that one can reach the terms of either A157037 or A327978 with a single step of A003415 only from squarefree numbers (or respectively, cubefree numbers that are not multiples of 4, see A328234), and in general, because A003415 decreases the maximal exponent of the prime factorization (A051903) at most by one, if the maximal exponent in the prime factorization of n is large, there is a correspondingly long path to traverse if we take only A003415-steps in the iteration, and any step could always lead with certain probability to a p^p-number. Note that the antiderivatives of primorials with a square factor seem quite rare, see A351029.
And although taking a A276086-step will always land us to a p^p-free number (which a priori is not in the obvious dead-end path of A003415, although of course it might eventually lead to one), it (in most cases) also increases the magnitude of number considerably, that tends to make the escape even harder. Particularly, in the majority of cases A276086 increases the maximal exponent (which in the preimage is A328114, "maximal digit value used when n is written in primorial base"), so there will be even a longer journey down to squarefree numbers when using A003415. See the sequences A351067 and A351071 for the diminishing ratios suggesting rapidly diminishing chances of successfully reaching zero from larger terms of A276086. Also, the asymptotic density of A276156 is zero, even though A351073 may contain a few larger values.
On the other hand, if we could prove that by (for example) continuing upwards with any p^p-path of A003415 we could eventually reach with a near certainty a region of numbers with low values of A328114 (i.e., numbers with smallish digits in primorial base, like A276156), then the situation might change (see also A351089). However, a few empirical runs seemed to indicate otherwise.
For all of the above reasons, I now conjecture that there are natural numbers from which it is not possible to reach zero with any combination of steps. For example 128 or 5^5 = 3125.
(End)

			Let -A> stand for an application of A003415 and -B> for an application of A276086, then, we have for example:
a(8) = 6 as we have 8 -A>  12 -B>  25 -A> 10 -A>  7 -A> 1 -A> 0, six transitions in total (and there are no shorter paths).
a(15) = 6 as we have 15 -B> 150 -A> 185 -A> 42 -A> 41 -A> 1 -A> 0, six transitions in total (and there are no shorter paths).
a(20) = 7, as 20 -B> 375 -A> 350 -A> 365 -A> 78 -A> 71 -A> 1 -A> 0, and there are no shorter paths.
For n=112, we know that a(112) cannot be larger than eight, as A328099^(8)(112) = 0, so we have a path of length 8 as 112 -A> 240 -B> 77 -A> 18 -A> 21 -A> 10 -A> 7 -A> 1 -A> 0. Checking all 32 combinations of the paths of lengths of 5 starting from 112 shows that none of them or their prefixes ends with a prime, thus there cannot be any shorter path, and indeed a(112) = 8.
a(24) <= 11 as A328099^(11)(24) = 0, i.e., we have 24 -A> 44 -A> 48 -A> 112 -A> 240 -B> 77 -A> 18 -A> 21 -A> 10 -A> 7 -A> 1 -A> 0. On the other hand, 24 -B> 625 -B> 17794411250 -A> 41620434625 -A> 58507928150 -A> 86090357185 -A> 54113940517 -A> 19982203325 -A> 12038411230 -A> 8426887871 -A> 1 -A> 0, thus offering another path of length 11.

Cf. A003415, A046099, A051674, A051903, A068346, A276086, A276087, A327859, A327860, A328099, A328112, A328114, A328116, A328307.
Cf. A328324 (a sequence giving upper bounds, computed with restricted search space).
Sequences for whose terms k, value a(k) has a guaranteed constant upper bound: A000040, A002110, A143293, A157037, A192192, A327978, A328232, A328233, A328239, A328240, A328243, A328249, A328313.
Sequences for whose terms k, it is guaranteed that a(k) has finite value > 0, even if not bound by a constant: A099308, A328116.
Cf. also A256750, A327966, A328110, A351029, A351088, A351067, A351071, A351073, A351089 and A351255, A351256, A351257, A351258, A351261.

A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
A327969(n,searchlim=0) = if(!n,n,my(xs=Set([n]),newxs,a,b,u); for(k=1,oo, print("n=", n, " k=", k, " xs=", xs); newxs=Set([]); for(i=1,#xs,u = xs[i]; a = A003415(u); if(0==a, return(k)); if(isprime(a), return(k+2)); b = A276086(u); if(isprime(b), return(k+1+(u>2))); newxs = setunion([a],newxs); if(!searchlim || (b<=searchlim),newxs = setunion([b],newxs))); xs = newxs));

a(0) = 0, a(p^p) = 1 + a(A276086(p^p)) for primes p, and for other numbers, a(n) = 1+min(a(A003415(n)), a(A276086(n))).
a(p) = 2 for all primes p.
For all n, a(n) <= A328324(n).
Let A stand the transition x -> A003415(x), and B stand for x -> A276086(x). The following sequences give some constant upper limits, because it is guaranteed that the combination given in brackets (the leftmost A or B is applied first) will always lead to a prime:
For all n, a(A157037(n)) = 3.  [A]
For n > 1, a(A002110(n)) = 3.  [B]
For all n, a(A192192(n)) <= 4. [AA]
For all n, a(A327978(n)) = 4.  [AB]
For all n, a(A328233(n)) <= 4. [BA]
For all n, a(A143293(n)) <= 4. [BB]
For all n, a(A328239(n)) <= 5. [AAA]
For all n, a(A328240(n)) <= 5. [BAA]
For all n, a(A328243(n)) <= 5. [ABB]
For all n, a(A328313(n)) <= 5. [BBB]
For all n, a(A328249(n)) <= 6. [BAAA]
For all k in A046099, a(k) >= 4, and if A328114(k) > 1, then certainly a(k) > 4.

A157037 Numbers with prime arithmetic derivative A003415.

Original entry on oeis.org

6, 10, 22, 30, 34, 42, 58, 66, 70, 78, 82, 105, 114, 118, 130, 142, 154, 165, 174, 182, 202, 214, 222, 231, 238, 246, 255, 273, 274, 282, 285, 286, 298, 310, 318, 345, 357, 358, 366, 370, 382, 385, 390, 394, 399, 418, 430, 434, 442, 454, 455, 465, 474, 478

Offset: 1

Reinhard Zumkeller, Feb 22 2009

nonn

Equivalently, solutions to n'' = 1, since n' = 1 iff n is prime. Twice the lesser of the twin primes, 2*A001359 = A108605, are a subsequence. - M. F. Hasler, Apr 07 2015

All terms are squarefree, because if there would be a prime p whose square p^2 would divide n, then A003415(n) = (A003415(p^2) * (n/p^2)) + (p^2 * A003415(n/p^2)) = p*[(2 * (n/p^2)) + (p * A003415(n/p^2))], which certainly is not a prime. - Antti Karttunen, Oct 10 2019

			A003415(42) = A003415(2*3*7) = 2*3+3*7+7*2 = 41 = A000040(13), therefore 42 is a term.

Antti Karttunen, Table of n, a(n) for n = 1..10001 (first 1000 terms from Reinhard Zumkeller)

Cf. A003415, A010051, A038554, A192082, A192189, A192190,  A327978, A328233, A328240, A328384, A328385.
Cf. A189441 (primes produced by these numbers), A241859.
Cf. A192192, A328239 (numbers whose 2nd and numbers whose 3rd arithmetic derivative is prime).
Cf. A108605, A256673 (subsequences).
Subsequence of following sequences: A005117, A099308, A235991, A328234 (A328393), A328244, A328321.

a157037 n = a157037_list !! (n-1)
a157037_list = filter ((== 1) . a010051' . a003415) [1..]
-- Reinhard Zumkeller, Apr 08 2015

dn[0] = 0; dn[1] = 0; dn[n_?Negative] := -dn[-n]; dn[n_] := Module[{f = Transpose[FactorInteger[n]]}, If[PrimeQ[n], 1, Total[n*f[[2]]/f[[1]]]]]; Select[Range[500], dn[dn[#]] == 1 &] (* T. D. Noe, Mar 07 2013 *)

A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
isA157037(n) = isprime(A003415(n)); \\ Antti Karttunen, Oct 19 2019

from itertools import count, islice
from sympy import isprime, factorint
def A157037_gen(): # generator of terms
    return filter(lambda n:isprime(sum(n*e//p for p,e in factorint(n).items())), count(2))
A157037_list = list(islice(A157037_gen(),20)) # Chai Wah Wu, Jun 23 2022

A010051(A003415(a(n))) = 1; A068346(a(n)) = 1; A099306(a(n)) = 0.

A003415(a(n)) = A328385(a(n)) = A241859(n); A327969(a(n)) = 3. - Antti Karttunen, Oct 19 2019

A056798 Prime powers with even nonnegative exponents.

Original entry on oeis.org

1, 4, 9, 16, 25, 49, 64, 81, 121, 169, 256, 289, 361, 529, 625, 729, 841, 961, 1024, 1369, 1681, 1849, 2209, 2401, 2809, 3481, 3721, 4096, 4489, 5041, 5329, 6241, 6561, 6889, 7921, 9409, 10201, 10609, 11449, 11881, 12769, 14641, 15625, 16129, 16384

Offset: 1

Labos Elemer, Aug 28 2000

nonn

Also numbers whose geometric mean of divisors is an integer. - Ctibor O. Zizka, Sep 29 2008

This is just a special case. In fact, the numbers whose geometric mean of divisors is an integer are all the squares of integers (A000290). - Daniel Lignon, Nov 29 2014

T. D. Noe, Table of n, a(n) for n = 1..10000

Cf. A000290, A000961, A025475, A154945.

Take[Union[Flatten[Table[Prime[n]^k, {n, 31}, {k, 0, 14, 2}]]], 45] (* Alonso del Arte, Jul 05 2011 *)

is(n)=my(e=isprimepower(n)); if(e, e%2==0, n==1) \\ Charles R Greathouse IV, Sep 18 2015

from sympy import primepi, integer_nthroot
def A056798(n):
    if n==1: return 1
    def f(x): return int(n-2+x-sum(primepi(integer_nthroot(x,k)[0])for k in range(2,x.bit_length(),2)))
    kmin, kmax = 1,2
    while f(kmax) >= kmax:
        kmax <<= 1
    while True:
        kmid = kmax+kmin>>1
        if f(kmid) < kmid:
            kmax = kmid
        else:
            kmin = kmid
        if kmax-kmin <= 1:
            break
    return kmax # Chai Wah Wu, Aug 13 2024

a(n) = A025473(n)^(2*A025474(n)) = A000961(n)^2;
A001222(a(n)) mod 2 = 0;
A003415(a(n)) = A192083(n); A068346(a(n)) = A192084(n). - Reinhard Zumkeller, Jun 26 2011
Sum_{n>=2} 1/a(n) = A154945. - Amiram Eldar, Sep 21 2020

A327862 Numbers whose arithmetic derivative is of the form 4k+2, cf. A003415.

Original entry on oeis.org

9, 21, 25, 33, 49, 57, 65, 69, 77, 85, 93, 121, 129, 133, 135, 141, 145, 161, 169, 177, 185, 201, 205, 209, 213, 217, 221, 237, 249, 253, 265, 289, 301, 305, 309, 315, 321, 329, 341, 351, 361, 365, 375, 377, 381, 393, 413, 417, 437, 445, 453, 459, 469, 473, 481, 485, 489, 493, 495, 497, 501, 505, 517, 529, 533, 537

Offset: 1

Antti Karttunen, Sep 30 2019

nonn

All terms are odd because the terms A068719 are either multiples of 4 or odd numbers.
Odd numbers k for which A064989(k) is one of the terms of A358762. - Antti Karttunen, Nov 30 2022
The second arithmetic derivative (A068346) of these numbers is odd. See A235991. - Antti Karttunen, Feb 06 2024

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

Setwise difference A235992 \ A327864.
Setwise difference A046337 \ A360110.
Union of A369661 (k' has an even number of prime factors) and A369662 (k' has an odd number of prime factors).
Subsequences: A001248 (from its second term onward), A108181, A327978, A366890 (when sorted into ascending order), A368696, A368697.
Cf. A003415, A064989, A068346, A068719, A327863, A327865, A353495 (characteristic function).
Cf. also A235991, A358762, A358772, A358774.

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
isA327862(n) = (2==(A003415(n)%4));
k=1; n=0; while(k<105, if(isA327862(n), print1(n, ", "); k++); n++);

A258651 A(n,k) = n^(k) = k-th arithmetic derivative of n; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Original entry on oeis.org

0, 0, 1, 0, 0, 2, 0, 0, 1, 3, 0, 0, 0, 1, 4, 0, 0, 0, 0, 4, 5, 0, 0, 0, 0, 4, 1, 6, 0, 0, 0, 0, 4, 0, 5, 7, 0, 0, 0, 0, 4, 0, 1, 1, 8, 0, 0, 0, 0, 4, 0, 0, 0, 12, 9, 0, 0, 0, 0, 4, 0, 0, 0, 16, 6, 10, 0, 0, 0, 0, 4, 0, 0, 0, 32, 5, 7, 11, 0, 0, 0, 0, 4, 0, 0, 0, 80, 1, 1, 1, 12

Offset: 0

Alois P. Heinz, Jun 06 2015

			Square array A(n,k) begins:
  0,  0,  0,  0,  0,   0,   0,   0,    0,    0, ...
  1,  0,  0,  0,  0,   0,   0,   0,    0,    0, ...
  2,  1,  0,  0,  0,   0,   0,   0,    0,    0, ...
  3,  1,  0,  0,  0,   0,   0,   0,    0,    0, ...
  4,  4,  4,  4,  4,   4,   4,   4,    4,    4, ...
  5,  1,  0,  0,  0,   0,   0,   0,    0,    0, ...
  6,  5,  1,  0,  0,   0,   0,   0,    0,    0, ...
  7,  1,  0,  0,  0,   0,   0,   0,    0,    0, ...
  8, 12, 16, 32, 80, 176, 368, 752, 1520, 3424, ...
  9,  6,  5,  1,  0,   0,   0,   0,    0,    0, ...

Alois P. Heinz, Antidiagonals n = 0..115, flattened
J. Kovič, The Arithmetic Derivative and Antiderivative, Journal of Integer Sequences 15 (2012), Article 12.3.8
Wikipedia, Arithmetic derivative

Columns k=0-10 give: A001477, A003415, A068346, A099306, A258644, A258645, A258646, A258647, A258648, A258649, A258650.
Rows n=0,1,4,8 give: A000004, A000007, A010709, A129150.
Row 15: A090636, Row 28: A090637, Row 63: A090635, Row 81: A129151, Row 128: A369638, Row 1024: A214800, Row 15625: A129152.
Main diagonal gives A185232.
Antidiagonal sums give A258652.
Cf. also A328383.

d:= n-> n*add(i[2]/i[1], i=ifactors(n)[2]):
A:= proc(n, k) option remember; `if`(k=0, n, d(A(n, k-1))) end:
seq(seq(A(n, h-n), n=0..h), h=0..14);

d[n_] := n*Sum[i[[2]]/i[[1]], {i, FactorInteger[n]}]; d[0] = d[1] = 0;
A[n_, k_] := A[n, k] = If[k == 0, n, d[A[n, k-1]]];
Table[A[n, h-n], {h, 0, 14}, {n, 0, h}] // Flatten (* Jean-François Alcover, Apr 27 2017, translated from Maple *)

A(n,k) = A003415^k(n).

A099306 n''', the third arithmetic derivative of n.

Original entry on oeis.org

0, 0, 0, 0, 4, 0, 0, 0, 32, 1, 0, 0, 80, 0, 5, 16, 176, 0, 7, 0, 48, 1, 0, 0, 112, 1, 12, 27, 176, 0, 0, 0, 368, 6, 0, 32, 96, 0, 7, 80, 156, 0, 0, 0, 240, 32, 7, 0, 608, 6, 16, 44, 96, 0, 216, 80, 272, 1, 0, 0, 272, 0, 9, 24, 2368, 10, 0, 0, 220, 8, 0, 0, 284, 0

Offset: 0

T. D. Noe, Oct 12 2004

nonn

For prime p, a(p^p) = p^p.

a(A157037(n)) = 0. - Reinhard Zumkeller, Feb 22 2009

See A003415.

Alois P. Heinz, Table of n, a(n) for n = 0..10000 (first 2000 terms from T. D. Noe)

Cf. A003415 (arithmetic derivative of n), A068346 (second arithmetic derivative of n), A099307 (least k such that the k-th arithmetic derivative of n is zero).

Column k=3 of A258651.

dn[0]=0; dn[1]=0; dn[n_]:=Module[{f=Transpose[FactorInteger[n]]}, If[PrimeQ[n], 1, Plus@@(n*f[[2]]/f[[1]])]]; Table[dn[dn[dn[n]]], {n, 100}]

a(n) = A003415(A003415(A003415(n))).

A230543 Numbers n that form a Pythagorean quadruple with n', n'' and sqrt(n^2 + n'^2 + n''^2), where n' and n'' are the first and the second arithmetic derivative of n.

Original entry on oeis.org

512, 1203, 3456, 6336, 23328, 42768, 157464, 249753, 288684, 400000, 722718, 1062882, 1948617, 2700000, 4950000, 18225000, 33412500, 105413504, 123018750, 225534375, 312500000, 408918816

Offset: 1

Paolo P. Lava, Oct 25 2013

Tested up to n = 4.09*10^8.

			If n = 6336 then n' = 23808, n'' = 103936 and sqrt(n^2 + n'^2 + n''^2) = 106816.

Eric Weisstein's World of Mathematics, Pythagorean Quadruple

Cf. A003415, A009003, A009004, A068346, A210503, A211176.

Cf. A096907-A096909 and A097263-A097266 for Pythagorean Quadruples.

with(numtheory): P:= proc(q) local a1, a2, n, p;
for n from 2 to q do a1:=n*add(op(2,p)/op(1,p),p=ifactors(n)[2]);
a2:=a1*add(op(2,p)/op(1,p),p=ifactors(a1)[2]);
if type(sqrt(n^2+a1^2+a2^2),integer) then print(n);
fi; od; end: P(10^10);

a(16)-a(18) from Giovanni Resta, Oct 25 2013
a(19) from Ray Chandler, Dec 22 2016
a(20) from Ray Chandler, Dec 31 2016
a(21) from Ray Chandler, Jan 05 2017
a(22) from Ray Chandler, Jan 09 2017

A328232 Numbers whose arithmetic derivative (A003415) is a primorial number, including cases where it is the first primorial, A002110(0) = 1.

Original entry on oeis.org

2, 3, 5, 7, 9, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 161, 163, 167, 173, 179, 181, 191, 193, 197, 199, 209, 211, 221, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317

Offset: 1

Antti Karttunen, Oct 09 2019

nonn

Numbers n such that A327859(n) = A276086(A003415(n)) is a prime.

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

Cf. A002110, A003415, A024451 (arith. deriv. of primorials), A068346, A276086, A327859, A328233.
Union of A000040 and A327978 (gives the composite terms).
Differs from A189710 for the first time by having term a(39) = 161, which is not included in A189710, while A189710(44) = 185 is the first term in latter that is not included here.

A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
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; };
A327859(n) = A276086(A003415(n));
isA328232(n) = isprime(A327859(n));

A369651 The second arithmetic derivative of primorial numbers.

Original entry on oeis.org

0, 0, 1, 1, 32, 1, 1, 37712, 381596, 9835475, 36880858, 5221912091, 149759057759, 186024798, 456607833524310, 655374897748042, 32188411533060, 3002590335363139484, 1, 1, 1489192548103758778136571, 905624730150525686386253700, 1, 110832638787270947169636975150, 331748330219014906068858, 349669183443106226663011852002384

Offset: 0

Antti Karttunen, Jan 31 2024

nonn

See comments in A024451.

Antti Karttunen, Table of n, a(n) for n = 0..49

Cf. A002110, A003415, A024451, A068346, A109628 (positions of 1's).

Cf. also A368702.

A002110(n) = prod(i=1,n,prime(i));
A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A369651(n) = A003415(A003415(A002110(n)));

a(n) = A003415(A024451(n)) = A068346(A002110(n)).

A334261 Numbers m that are solutions of the arithmetic differential equation 2m" - m' - 4 = 0.

Original entry on oeis.org

4, 9, 21, 25, 33, 49, 57, 69, 85, 93, 121, 129, 133, 145, 169, 177, 205, 213, 217, 237, 249, 253, 265, 289, 309, 361, 393, 417, 445, 469, 489, 493, 505, 517, 529, 553, 565, 573, 597, 633, 669, 685, 697, 753, 781, 793, 813, 817, 841, 865, 889, 913, 933, 949, 961, 973, 985, 993

Offset: 1

Nathan Mabey, Apr 20 2020

Contains all the squared primes, plus additional terms.

At least some of these additional terms that are not divisible by 3 are given by the product of the smallest prime in a prime triplet, and the largest prime in that triplet, this certainly being true until the term 11413.

			4 is a term since 4'' = 4, 4' = 4, and 2*4 - 4 - 4 = 0.

Nathan Mabey, Table of n, a(n) for n = 1..20263

Cf. A003415 (n'), A068346 (n"), A001248 (squared primes), A368701 (characteristic function).

Cf. also A189941.

d(n) = if (n>0, my(f=factor(n)); sum(i=1, #f~, n*f[i, 2]/f[i, 1]), 0);
isok(m) = -2*d(d(m)) + d(m) + 4 == 0; \\ Michel Marcus, Apr 21 2020

from sympy import factorint
def d(n): return sum(n*e//p for p, e in factorint(n).items())
def ok(m): return m > 1 and 2*d(d(m)) - d(m) == 4
print([k for k in range(1, 999) if ok(k)]) # Michael S. Branicky, Aug 15 2022

cp's OEIS Frontend

A327969 The length of a shortest path from n to zero when using the transitions x -> A003415(x) and x -> A276086(x), or -1 if no zero can ever be reached from n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

Formula

A157037 Numbers with prime arithmetic derivative A003415.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Python

Formula

A056798 Prime powers with even nonnegative exponents.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A327862 Numbers whose arithmetic derivative is of the form 4k+2, cf. A003415.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A258651 A(n,k) = n^(k) = k-th arithmetic derivative of n; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A099306 n''', the third arithmetic derivative of n.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Formula

A230543 Numbers n that form a Pythagorean quadruple with n', n'' and sqrt(n^2 + n'^2 + n''^2), where n' and n'' are the first and the second arithmetic derivative of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Extensions

A328232 Numbers whose arithmetic derivative (A003415) is a primorial number, including cases where it is the first primorial, A002110(0) = 1.