A328248 -id:A328248 - cp's OEIS frontend

A328250 Square array A(n,k) read by descending antidiagonals where A(n,k) is the k-th solution x to A328248(x) = n-1.

4, 8, 1, 12, 2, 9, 16, 3, 18, 50, 20, 5, 25, 99, 306, 24, 6, 45, 125, 549, 5831, 27, 7, 49, 207, 1611, 6849, 20230, 28, 10, 63, 343, 2662, 14225, 33026, 52283, 32, 11, 75, 375, 2842, 16299, 47107, 225998, 286891, 36, 13, 90, 531, 2891, 19431, 49806, 1336047, 1292750, 10820131, 40, 14, 98, 686, 4575, 21231, 117649, 1422275, 2886982, 21628098, 38452606

Offset: 1

Antti Karttunen, Oct 12 2019

Row 1 of the array is reserved for numbers for which no squarefree number is ever reached, and from then on, each row n > 1 of array gives in ascending order all natural numbers that require n-2 iterations of arithmetic derivative (A003415) to reach a squarefree number. Squarefree numbers (A005117) thus occupy the row 2, as they require no iterations.

			The upper left corner of the array:
         4,        8,       12,       16,       20,       24,       27,       28,
         1,        2,        3,        5,        6,        7,       10,       11,
         9,       18,       25,       45,       49,       63,       75,       90,
        50,       99,      125,      207,      343,      375,      531,      686,
       306,      549,     1611,     2662,     2842,     2891,     4575,     4802,
      5831,     6849,    14225,    16299,    19431,    21231,    22638,    24010,
     20230,    33026,    47107,    49806,   117649,   121671,   145386,   162707,
     52283,   225998,  1336047,  1422275,  1500759,  1576899,  2309503,  3023398,
    286891,  1292750,  2886982,  3137526,  6882453,  8703459, 15358457, 16777114,
  10820131, 21628098, 23934105, 24332763, 46295435, 51320698, 52320191, 56199375,
  38452606, ...
  ...

Index entries for sequences that are permutations of the natural numbers

Cf. A003415, A328248.
Column 1: A328302.
Rows 1 - 4 are: A328251, A005117, A328252, A328253.

up_to = 45; \\ 10585 = binomial(145+1,2)
A003415checked(n) = if(n<=1, 0, my(f=factor(n), s=0); for(i=1, #f~, if(f[i,2]>=f[i,1],return(0), s += f[i, 2]/f[i, 1])); (n*s));
A328248(n) = { my(k=1); while(n && !issquarefree(n), k++; n = A003415checked(n)); (!!n*k); };
memoA328250sq = Map();
A328250sq(n, k) = { my(v=0); if(!mapisdefined(memoA328250sq,[n,k-1],&v),if(1==k, v=0, v = A328250sq(n, k-1))); for(i=1+v,oo,if((1+A328248(i))==n,mapput(memoA328250sq,[n,k],i); return(i))); };
A328250list(up_to) = { my(v = vector(up_to), i=0); for(a=1,oo, for(col=1,a, i++; if(i > up_to, return(v)); v[i] = A328250sq(col,(a-(col-1))))); (v); };
v328250 = A328250list(up_to);
A328250(n) = v328250[n];

A003415 a(n) = n' = arithmetic derivative of n: a(0) = a(1) = 0, a(prime) = 1, a(mn) = ma(n) + n*a(m).

Original entry on oeis.org

0, 0, 1, 1, 4, 1, 5, 1, 12, 6, 7, 1, 16, 1, 9, 8, 32, 1, 21, 1, 24, 10, 13, 1, 44, 10, 15, 27, 32, 1, 31, 1, 80, 14, 19, 12, 60, 1, 21, 16, 68, 1, 41, 1, 48, 39, 25, 1, 112, 14, 45, 20, 56, 1, 81, 16, 92, 22, 31, 1, 92, 1, 33, 51, 192, 18, 61, 1, 72, 26, 59, 1, 156, 1, 39, 55, 80, 18, 71

Offset: 0

N. J. A. Sloane, R. K. Guy

Can be extended to negative numbers by defining a(-n) = -a(n).
Based on the product rule for differentiation of functions: for functions f(x) and g(x), (fg)' = f'g + fg'. So with numbers, (ab)' = a'b + ab'. This implies 1' = 0. - Kerry Mitchell, Mar 18 2004
The derivative of a number x with respect to a prime number p as being the number "dx/dp" = (x-x^p)/p, which is an integer due to Fermat's little theorem. - Alexandru Buium, Mar 18 2004
The relation (ab)' = a'b + ab' implies 1' = 0, but it does not imply p' = 1 for p a prime. In fact, any function f defined on the primes can be extended uniquely to a function on the integers satisfying this relation: f(Product_i p_i^e_i) = (Product_i p_i^e_i) * (Sum_i e_i*f(p_i)/p_i). - Franklin T. Adams-Watters, Nov 07 2006
See A131116 and A131117 for record values and where they occur. - Reinhard Zumkeller, Jun 17 2007
Let n be the product of a multiset P of k primes. Consider the k-dimensional box whose edges are the elements of P. Then the (k-1)-dimensional surface of this box is 2*a(n). For example, 2*a(25) = 20, the perimeter of a 5 X 5 square. Similarly, 2*a(18) = 42, the surface area of a 2 X 3 X 3 box. - David W. Wilson, Mar 11 2011
The arithmetic derivative n' was introduced, probably for the first time, by the Spanish mathematician José Mingot Shelly in June 1911 with "Una cuestión de la teoría de los números", work presented at the "Tercer Congreso Nacional para el Progreso de las Ciencias, Granada", cf. link to the abstract on Zentralblatt MATH, and L. E. Dickson, History of the Theory of Numbers. - Giorgio Balzarotti, Oct 19 2013
a(A235991(n)) odd; a(A235992(n)) even. - Reinhard Zumkeller, Mar 11 2014
Sequence A157037 lists numbers with prime arithmetic derivative, i.e., indices of primes in this sequence. - M. F. Hasler, Apr 07 2015
Maybe the simplest "natural extension" of the arithmetic derivative, in the spirit of the above remark by Franklin T. Adams-Watters (2006), is the "pi based" version where f(p) = primepi(p), see sequence A258851. When f is chosen to be the identity map (on primes), one gets A066959. - M. F. Hasler, Jul 13 2015
When n is composite, it appears that a(n) has lower bound 2*sqrt(n), with equality when n is the square of a prime, and a(n) has upper bound (n/2)*log_2(n), with equality when n is a power of 2. - Daniel Forgues, Jun 22 2016
If n = p1*p2*p3*... where p1, p2, p3, ... are all the prime factors of n (not necessarily distinct), and h is a real number (we assume h nonnegative and < 1), the arithmetic derivative of n is equivalent to n' = lim_{h->0} ((p1+h)*(p2+h)*(p3+h)*... - (p1*p2*p3*...))/h. It also follows that the arithmetic derivative of a prime is 1. We could assume h = 1/N, where N is an integer; then the limit becomes {N -> oo}. Note that n = 1 is not a prime and plays the role of constant. - Giorgio Balzarotti, May 01 2023

			6' = (2*3)' = 2'*3 + 2*3' = 1*3 + 2*1 = 5.
Note that, for example, 2' + 3' = 1 + 1 = 2, (2+3)' = 5' = 1. So ' is not linear.
G.f. = x^2 + x^3 + 4*x^4 + x^5 + 5*x^6 + x^7 + 12*x^8 + 6*x^9 + 7*x^10 + ...

G. Balzarotti, P. P. Lava, La derivata aritmetica, Editore U. Hoepli, Milano, 2013.
E. J. Barbeau, Problem, Canad. Math. Congress Notes, 5 (No. 8, April 1973), 6-7.
L. E. Dickson, History of the Theory of Numbers, Vol. 1, Chapter XIX, p. 451, Dover Edition, 2005. (Work originally published in 1919.)
A. M. Gleason et al., The William Lowell Putnam Mathematical Competition: Problems and Solutions 1938-1964, Math. Assoc. America, 1980, p. 295.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 0..10000
Krassimir T. Atanassov, A formula for the n-th prime number, Comptes rendus de l'Académie bulgare des Sciences, Tome 66, No 4, 2013.
E. J. Barbeau, Remark on an arithmetic derivative, Canad. Math. Bull. vol. 4, no. 2, May 1961.
A. Buium, Home Page
A. Buium, Differential characters of Abelian varieties over p-adic fields, Invent. Math. 122 (1995), no. 2, 309-340.
A. Buium, Geometry of p-jets, Duke Math. J. 82 (1996), no. 2, 349-367.
A. Buium, Arithmetic analogues of derivations, J. Algebra 198 (1997), no. 1, 290-299.
A. Buium, Differential modular forms, J. Reine Angew. Math. 520 (2000), 95-167.
Brad Emmons and Xiao Xiao, The Arithmetic Partial Derivative, arXiv:2201.12453 [math.NT], 2022.
José María Grau and Antonio M. Oller-Marcén, Giuga Numbers and the Arithmetic Derivative, Journal of Integer Sequences, Vol. 15 (2012), #12.4.1.
R. K. Guy, Letter to N. J. A. Sloane, Apr 1975
P. Haukkanen, M. Mattila, J. K. Merikoski and T. Tossavainen, Can the Arithmetic Derivative be Defined on a Non-Unique Factorization Domain?, Journal of Integer Sequences, 16 (2013), #13.1.2. - From _N. J. A. Sloane_, Feb 03 2013
P. Haukkanen, J. K. Merikoski and T. Tossavainen, Asymptotics of partial sums of the Dirichlet series of the arithmetic derivative, Mathematical Communications 25 (2020), 107-115.
Antti Karttunen, Program in LODA-assembly
J. Kovič, The Arithmetic Derivative and Antiderivative, Journal of Integer Sequences 15 (2012), Article 12.3.8.
Michael Penn, When the derivative of a number is not zero -- The arithmetic derivative., YouTube video, 2022.
Ivars Peterson, Deriving the Structure of Numbers, Science News, March 20, 2004.
D. J. M. Shelly, Una cuestión de la teoria de los numeros, Asociation Esp. Granada 1911, 1-12 S (1911). (Abstract of ref. JFM42.0209.02 on zbMATH.org)
T. Tossavainen, P. Haukkanen, J. K. Merikoski, and M. Mattila, We can differentiate numbers, too, The College Mathematics Journal 55 (2024), no. 2, 100-108.
Victor Ufnarovski and Bo Åhlander, How to Differentiate a Number, J. Integer Seqs., Vol. 6, 2003, #03.3.4.
Linda Westrick, Investigations of the Number Derivative, Siemens Foundation competition 2003 and Intel Science Talent Search 2004.
Wikipedia, Arithmetic derivative

Cf. A086134 (least prime factor of n').
Cf. A086131 (greatest prime factor of n').
Cf. A068719 (derivative of 2n).
Cf. A068720 (derivative of n^2).
Cf. A068721 (derivative of n^3).
Cf. A001787 (derivative of 2^n).
Cf. A027471 (derivative of 3^(n-1)).
Cf. A085708 (derivative of 10^n).
Cf. A068327 (derivative of n^n).
Cf. A024451 (derivative of p#).
Cf. A068237 (numerator of derivative of 1/n).
Cf. A068238 (denominator of derivative of 1/n).
Cf. A068328 (derivative of squarefree numbers).
Cf. A068311 (derivative of n!).
Cf. A168386 (derivative of n!!).
Cf. A260619 (derivative of hyperfactorial(n)).
Cf. A260620 (derivative of superfactorial(n)).
Cf. A068312 (derivative of triangular numbers).
Cf. A068329 (derivative of Fibonacci(n)).
Cf. A096371 (derivative of partition number).
Cf. A099301 (derivative of d(n)).
Cf. A099310 (derivative of phi(n)).
Cf. A342925 (derivative of sigma(n)).
Cf. A349905 (derivative of prime shift).
Cf. A327860 (derivative of primorial base exp-function).
Cf. A369252 (derivative of products of three odd primes), A369251 (same sorted).
Cf. A068346 (second  derivative of n).
Cf. A099306 (third   derivative of n).
Cf. A258644 (fourth  derivative of n).
Cf. A258645 (fifth   derivative of n).
Cf. A258646 (sixth   derivative of n).
Cf. A258647 (seventh derivative of n).
Cf. A258648 (eighth  derivative of n).
Cf. A258649 (ninth   derivative of n).
Cf. A258650 (tenth   derivative of n).
Cf. A185232 (n-th    derivative of n).
Cf. A258651 (A(n,k) = k-th arithmetic derivative of n).
Cf. A085731 (gcd(n,n')), A083345 (n'/gcd(n,n')), A057521 (gcd(n, (n')^k) for k>1).
Cf. A342014 (n' mod n), A369049 (n mod n').
Cf. A341998 (A003557(n')), A342001 (n'/A003557(n)).
Cf. A098699 (least x such that x' = n, antiderivative of n).
Cf. A098700 (n such that x' = n has no integer solution).
Cf. A099302 (number of solutions to x' = n).
Cf. A099303 (greatest x such that x' = n).
Cf. A051674 (n such that n' = n).
Cf. A083347 (n such that n' < n).
Cf. A083348 (n such that n' > n).
Cf. A099304 (least k such that (n+k)' = n' + k').
Cf. A099305 (number of solutions to (n+k)' = n' + k').
Cf. A328235 (least k > 0 such that (n+k)' = u * n' for some natural number u).
Cf. A328236 (least m > 1 such that (m*n)' = u * n' for some natural number u).
Cf. A099307 (least k such that the k-th arithmetic derivative of n is zero).
Cf. A099308 (k-th arithmetic derivative of n is zero for some k).
Cf. A099309 (k-th arithmetic derivative of n is nonzero for all k).
Cf. A129150 (n-th derivative of 2^3).
Cf. A129151 (n-th derivative of 3^4).
Cf. A129152 (n-th derivative of 5^6).
Cf. A189481 (x' = n has a unique solution).
Cf. A190121 (partial sums).
Cf. A258057 (first differences).
Cf. A229501 (n divides the n-th partial sum).
Cf. A165560 (parity).
Cf. A235991 (n' is odd), A235992 (n' is even).
Cf. A327863, A327864, A327865 (n' is a multiple of 3, 4, 5).
Cf. A157037 (n' is prime), A192192 (n'' is prime), A328239 (n''' is prime).
Cf. A328393 (n' is squarefree), A328234 (squarefree and > 1).
Cf. A328244 (n'' is squarefree), A328246 (n''' is squarefree).
Cf. A328303 (n' is not squarefree), A328252 (n' is squarefree, but n is not).
Cf. A328248 (least k such that the (k-1)-th derivative of n is squarefree).
Cf. A328251 (k-th arithmetic derivative is never squarefree for any k >= 0).
Cf. A256750 (least k such that the k-th derivative is either 0 or has a factor p^p).
Cf. A327928 (number of distinct primes p such that p^p divides n').
Cf. A342003 (max. exponent k for any prime power p^k that divides n').
Cf. A327929 (n' has at least one divisor of the form p^p).
Cf. A327978 (n' is primorial number > 1).
Cf. A328243 (n' is a partial sum of primorial numbers and larger than one).
Cf. A328310 (maximal prime exponent of n' minus maximal prime exponent of n).
Cf. A328320 (max. prime exponent of n' is less than that of n).
Cf. A328321 (max. prime exponent of n' is >= that of n).
Cf. A328383 (least k such that the k-th derivative of n is either a multiple or a divisor of n, but not both).
Cf. A263111 (the ordinal transform of a).
Cf. A300251, A319684 (Möbius and inverse Möbius transform).
Cf. A305809 (Dirichlet convolution square).
Cf. A349133, A349173, A349394, A349380, A349618, A349619, A349620, A349621 (for miscellaneous Dirichlet convolutions).
Cf. A069359 (similar formula which agrees on squarefree numbers).
Cf. A258851 (the pi-based arithmetic derivative of n).
Cf. A328768, A328769 (primorial-based arithmetic derivatives of n).
Cf. A328845, A328846 (Fibonacci-based arithmetic derivatives of n).
Cf. A302055, A327963, A327965, A328099 (for other variants and modifications).
Cf. A038554 (another sequence using "derivative" in its name, but involving binary expansion of n).
Cf. A322582, A348507 (lower and upper bounds), also A002620.

A003415:= Concatenation([0,0],List(List([2..10^3],Factors),
i->Product(i)*Sum(i,j->1/j))); # Muniru A Asiru, Aug 31 2017
(APL, Dyalog dialect) A003415 ← { ⍺←(0 1 2) ⋄ ⍵≤1:⊃⍺ ⋄ 0=(3⊃⍺)|⍵:((⊃⍺+(2⊃⍺)×(⍵÷3⊃⍺)) ((2⊃⍺)×(3⊃⍺)) (3⊃⍺)) ∇ ⍵÷3⊃⍺ ⋄ ((⊃⍺) (2⊃⍺) (1+(3⊃⍺))) ∇ ⍵} ⍝ Antti Karttunen, Feb 18 2024

a003415 0 = 0
a003415 n = ad n a000040_list where
  ad 1 _             = 0
  ad n ps'@(p:ps)
     | n < p * p     = 1
     | r > 0         = ad n ps
     | otherwise     = n' + p * ad n' ps' where
       (n',r) = divMod n p
-- Reinhard Zumkeller, May 09 2011

Ad:=func; [n le 1 select 0 else Ad(n): n in [0..80]]; // Bruno Berselli, Oct 22 2013

A003415 := proc(n) local B,m,i,t1,t2,t3; B := 1000000000039; if n<=1 then RETURN(0); fi; if isprime(n) then RETURN(1); fi; t1 := ifactor(B*n); m := nops(t1); t2 := 0; for i from 1 to m do t3 := op(i,t1); if nops(t3) = 1 then t2 := t2+1/op(t3); else t2 := t2+op(2,t3)/op(op(1,t3)); fi od: t2 := t2-1/B; n*t2; end;
A003415 := proc(n)
        local a,f;
        a := 0 ;
        for f in ifactors(n)[2] do
                a := a+ op(2,f)/op(1,f);
        end do;
        n*a ;
end proc: # R. J. Mathar, Apr 05 2012

a[ n_] := If[ Abs @ n < 2, 0, n Total[ #2 / #1 & @@@ FactorInteger[ Abs @ n]]]; (* Michael Somos, Apr 12 2011 *)
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]]]]]; Table[dn[n], {n, 0, 100}] (* T. D. Noe, Sep 28 2012 *)

A003415(n) = {local(fac);if(n<1,0,fac=factor(n);sum(i=1,matsize(fac)[1],n*fac[i,2]/fac[i,1]))} /* Michael B. Porter, Nov 25 2009 */

apply( A003415(n)=vecsum([n/f[1]*f[2]|f<-factor(n+!n)~]), [0..99]) \\ M. F. Hasler, Sep 25 2013, updated Nov 27 2019

A003415(n) = { my(s=0, m=1, spf); while(n>1, spf = A020639(n); n /= spf; s += m*n; m *= spf); (s); }; \\ Antti Karttunen, Mar 10 2021

a(n) = my(f=factor(n), r=[1/(e+!e)|e<-f[,1]], c=f[,2]); n*r*c; \\ Ruud H.G. van Tol, Sep 03 2023

from sympy import factorint
def A003415(n):
    return sum([int(n*e/p) for p,e in factorint(n).items()]) if n > 1 else 0
# Chai Wah Wu, Aug 21 2014

def A003415(n):
    F = [] if n == 0 else factor(n)
    return n * sum(g / f for f, g in F)
[A003415(n) for n in range(79)] # Peter Luschny, Aug 23 2014

If n = Product p_i^e_i, a(n) = n * Sum (e_i/p_i).
a(m*p^p) = (m + a(m))*p^p, p prime: a(m*A051674(k))=A129283(m)*A051674(k). - Reinhard Zumkeller, Apr 07 2007
For n > 1: a(n) = a(A032742(n)) * A020639(n) + A032742(n). - Reinhard Zumkeller, May 09 2011
a(n) = n * Sum_{p|n} v_p(n)/p, where v_p(n) is the largest power of the prime p dividing n. - Wesley Ivan Hurt, Jul 12 2015
For n >= 2, Sum_{k=2..n} floor(1/a(k)) = pi(n) = A000720(n) (see K. T. Atanassov article). - Ivan N. Ianakiev, Mar 22 2019
From A.H.M. Smeets, Jan 17 2020: (Start)
Limit_{n -> oo} (1/n^2)*Sum_{i=1..n} a(i) = A136141/2.
Limit_{n -> oo} (1/n)*Sum_{i=1..n} a(i)/i = A136141.
a(n) = n if and only if n = p^p, where p is a prime number. (End)
Dirichlet g.f.: zeta(s-1)*Sum_{p prime} 1/(p^s-p), see A136141 (s=2), A369632 (s=3) [Haukkanen, Merikoski and Tossavainen]. - Sebastian Karlsson, Nov 25 2021
From Antti Karttunen, Nov 25 2021: (Start)
a(n) = Sum_{d|n} d * A349394(n/d).
For all n >= 1, A322582(n) <= a(n) <= A348507(n).
If n is not a prime, then a(n) >= 2*sqrt(n), or in other words, for all k >= 1 for which A002620(n)+k is not a prime, we have a(A002620(n)+k) > n. [See Ufnarovski and Åhlander, Theorem 9, point (3).]
(End)

More terms from Michel ten Voorde, Apr 11 2001

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

A328252 Numbers that are not squarefree, but whose arithmetic derivative (A003415) is.

Original entry on oeis.org

9, 18, 25, 45, 49, 63, 75, 90, 98, 117, 121, 126, 147, 150, 153, 169, 171, 175, 198, 234, 242, 245, 261, 279, 289, 294, 315, 325, 333, 338, 342, 350, 361, 363, 369, 387, 414, 423, 425, 450, 475, 477, 490, 495, 507, 522, 529, 539, 550, 558, 575, 578, 603, 605, 630, 637, 639, 650, 657, 666, 711, 722, 726, 735, 738, 774, 775, 801

Offset: 1

Antti Karttunen, Oct 11 2019

nonn

			18 = 2 * 3^2 is not squarefree, but its arithmetic derivative A003415(18) = 21 = 3*7 is, thus 18 is included in this sequence.

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

Cf. A003415, A328253.
Row 3 of array A328250. Positions of 2's in A328248.
Setwise difference A328234 \ A005117. Intersection of A013929 and A328234.

A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
isA328252(n) = (!issquarefree(n) && issquarefree(A003415(n)));

A003415checked(n) = if(n<=1, 0, my(f=factor(n), s=0); for(i=1, #f~, if(f[i,2]>=f[i,1],return(0), s += f[i, 2]/f[i, 1])); (n*s));
A328248(n) = { my(k=1); while(n && !issquarefree(n), k++; n = A003415checked(n)); (!!n*k); };
isA328252(n) = (2==A328248(n));

A328253 Nonsquarefree numbers whose first arithmetic derivative (A003415) is not squarefree, but the second derivative (A068346) is.

Original entry on oeis.org

50, 99, 125, 207, 343, 375, 531, 686, 725, 747, 750, 819, 875, 931, 1083, 1175, 1331, 1375, 1750, 1775, 1899, 2057, 2058, 2075, 2197, 2250, 2299, 2331, 2367, 2499, 2525, 2625, 2750, 2853, 3250, 3425, 3430, 3577, 3610, 3771, 3789, 3843, 3875, 4059, 4149, 4250, 4311, 4394, 4459, 4475, 4626, 4693, 4750, 4775, 4875, 4913, 4998, 5145

Offset: 1

Antti Karttunen, Oct 11 2019

nonn

			50 (= 2 * 5^2) is not squarefree, and its first derivative A003415(50) = 45 = 3^2 * 5 also is not squarefree, but taking derivative yet again, gives A003415(45) = 39 = 3*13, which is squarefree, thus 50 is included in this sequence.

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

Cf. A003415, A328251.
Row 4 of array A328250. Indices of 3's in A328248.
Setwise difference A328245 \ A005117. Intersection of A013929 and A328245.

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

A003415checked(n) = if(n<=1, 0, my(f=factor(n), s=0); for(i=1, #f~, if(f[i,2]>=f[i,1],return(0), s += f[i, 2]/f[i, 1])); (n*s));
A328248(n) = { my(k=1); while(n && !issquarefree(n), k++; n = A003415checked(n)); (!!n*k); };
isA328253(n) = (3==A328248(n));

A328251 Row 1 of array A328250: numbers n whose k-th arithmetic derivative is never squarefree for any k >= 0.

Original entry on oeis.org

4, 8, 12, 16, 20, 24, 27, 28, 32, 36, 40, 44, 48, 52, 54, 56, 60, 64, 68, 72, 76, 80, 81, 84, 88, 92, 96, 100, 104, 108, 112, 116, 120, 124, 128, 132, 135, 136, 140, 144, 148, 152, 156, 160, 162, 164, 168, 172, 176, 180, 184, 188, 189, 192, 196, 200, 204, 208, 212, 216, 220, 224, 225, 228, 232, 236, 240, 243, 244, 248, 250, 252, 256, 260, 264, 268, 270, 272

Offset: 1

Antti Karttunen, Oct 11 2019

nonn

This probably is NOT an intersection of A013929 and A099309.

			We see that 225 = 3^2 * 5^2 is not squarefree, and then when starting iterating with A003415, we obtain --> 240 --> 608 --> 1552 --> ... which is a trajectory that will never reach neither a prime nor any squarefree number at all, because already 240 = 2^4 * 3 * 5 is a member of A100716, whose terms all belong into A099309, as any divisor of the form p^p of n will be always present when taking its successive arithmetic derivatives. Thus 225 is included in this sequence.

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

Row 1 of array A328250. Indices of zeros in A328248.
Cf. A003415, A099309, A327929, A327934.
Cf. A013929, A100716 (a subsequence).
Differs from A100716 and A276079 for the first time at a(63) = 225, the term which is not present in them.

A003415checked(n) = if(n<=1, 0, my(f=factor(n), s=0); for(i=1, #f~, if(f[i,2]>=f[i,1],return(0), s += f[i, 2]/f[i, 1])); (n*s));
A328248(n) = { my(k=1); while(n && !issquarefree(n), k++; n = A003415checked(n)); (!!n*k); };
isA328251(n) = (0==A328248(n));

A328305 Numbers that are cubefree, but not squarefree and whose first arithmetic derivative is not squarefree, but some k-th (with k >= 2) derivative is.

Original entry on oeis.org

50, 99, 207, 306, 531, 549, 725, 747, 819, 931, 1083, 1175, 1611, 1775, 1899, 2057, 2075, 2299, 2331, 2367, 2499, 2525, 2842, 2853, 2891, 3425, 3577, 3610, 3771, 3789, 3843, 4059, 4149, 4311, 4475, 4575, 4626, 4693, 4775, 4998, 5239, 5274, 5341, 5547, 5634, 5706, 5715, 5746, 5819, 5949, 6147, 6223, 6275, 6381, 6413, 6475, 6575

Offset: 1

Antti Karttunen, Oct 13 2019

nonn

Numbers n for which A051903(n) = 2 and A328248(n) > 2.

			50 is not squarefree, as 50 = 2 * 5^2, and neither its arithmetic derivative A003415(50) = 45 = 3^2 * 5 is squarefree, but its second derivative A003415(45) = 39 = 3*13 is, thus 50 is included in this sequence.

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

Cf A003415, A051903, A328248, A328253.

Subsequence of A067259, A328303, A328304 and A328321.

A003415checked(n) = if(n<=1, 0, my(f=factor(n), s=0); for(i=1, #f~, if(f[i,2]>=f[i,1],return(0), s += f[i, 2]/f[i, 1])); (n*s));
A051903(n) = if((1==n),0,vecmax(factor(n)[, 2]));
A328248(n) = { my(k=1); while(n && !issquarefree(n), k++; n = A003415checked(n)); (!!n*k); };
isA067259(n) = (2==A051903(n));
isA328305(n) = (isA067259(n)&&(A328248(n)>2));

A328383 a(n) gives the number of iterations of x -> A003415(x) needed to reach the first number which is either a divisor or multiple of n, but not both at the same time. If no such number can ever be reached, a(n) is 0 (when either n is of the form p^p, or if the iteration would never stop). When the number reached is a divisor of n, a(n) is -1 * iteration count.

Original entry on oeis.org

-1, -1, 0, -1, -2, -1, 2, -3, -2, -1, 9, -1, -4, 23, 1, -1, -4, -1, 5, -2, -2, -1, 2, -3, 24, 0, 18, -1, -2, -1, 6, -5, -2, 85, 7, -1, -4, 21, 10, -1, -2, -1, 35, 53, -4, -1, 2, -5, 44, 18, 34, -1, 2, 21, 4, -3, -2, -1, 16, -1, -6, 21, 1, -5, -2, -1, 7, 85, -2, -1, 4, -1, 23, 55, 5, -4, -2, -1, 4, 9, -2, -1, 42, -3, 42

Offset: 2

Antti Karttunen, Oct 15 2019

The absolute value of a(n) tells how many columns right from the leftmost column in array A258651 one needs to go at row n, before one (again) finds either a divisor or a multiple of n, with 0's reserved for cases like 4 and 27 where the same value continues forever. If one finds a divisor before a multiple, then the value of a(n) will be negative, otherwise it will be positive.

Question: What is the value of a(91) ?

			For n = 6, its arithmetic derivative A003415(6) = 5 is neither its divisor nor its multiple, but the second arithmetic derivative A003415(5) = 1 is its divisor, thus a(6) = -2.
For n = 8, its arithmetic derivative A003415(8) = 12 is neither its divisor nor its multiple, but the second arithmetic derivative A003415(12) = 16 is its multiple, thus a(8) = +2.
Numbers reached for n=2..28 (with positions of the form p^p are filled with the same p^p): 1, 1, 4, 1, 1, 1, 16, 1, 1, 1, 8592, 1, 1, 410267320320, 32, 1, 1, 1, 240, 7, 1, 1, 48, 1, 410267320320, 27, 9541095424. For example, we have a(12) = 9 and the 9th arithmetic derivative of 12 is A003415^(9)(12) = 8592 = 716*12.

Antti Karttunen, Table of n, a(n) for n = 2..90

Cf. A003415, A258651, A328235, A328236.
Cf. A051674 (indices of zeros provided for all n >= 2 either a divisor or multiple can be found).
Cf. A256750, A328248, A328384 for similar counts.

A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A328383(n) = { my(u=A003415(n),k=1); if(u==n,return(0)); while((n%u) && (u%n), k++; u = A003415(u)); if(u%n,-k,k); };

a(A000040(n)) = -1.

a(A051674(n)) = 0.

A328384 If n is of the form p^p, a(n) = 0, otherwise a(n) gives the number of iterations of x -> A003415(x) needed to reach the first number different from n which is either a prime, or whose degree (A051903) differs from the degree of n. If the degree of the final number is <= that of n, then a(n) = -1 * iteration count.

Original entry on oeis.org

-1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, 1, -1, 1, 1, 1, -1, -1, -1, 1, -2, -1, -1, -1, -1, 2, 0, 1, -1, -1, -1, -1, 2, -1, 1, 3, -1, -3, 1, -1, -1, -1, -1, 1, -1, 1, -1, 3, -1, -2, 1, 1, -1, 1, 1, -1, -2, -1, -1, 2, -1, 3, -1, 2, 1, -1, -1, 1, 3, -1, -1, -1, -1, 2, -1, 1, 1, -1, -1, 5, -1, -1, -1, 2, -2, 1, 1, -1, -1, -1, 1, 1, -2, 1

Offset: 1

Antti Karttunen, Oct 15 2019

sign

The records -1, 0, 1, 2, 3, 5, 8, 10, 11, 13, ... occur at n = 1, 4, 12, 26, 36, 80, 108, 4887, 18688, 22384, ...

			For n = 21 = 3*7, A051903(21) = 1, A003415(21) = 10 = 2*5, is of the same degree as A051903(10) = 1, but then A003415(10) = 7, which is a prime, having degree <= of the starting value (as we have A051903(7) <= A051903(21)), thus a(21) = -1 * 2 = -2.
For n = 33 = 3*11, A051903(33) = 1, A003415(33) = 14 = 2*7, is of the same degree, but on the second iteration, A003415(14) = 9 = 3^2, with A051903(9) = 2, which is larger than the initial degree, thus a(33) = +2.

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

Cf. A003415, A051903, A051674, A157037, A258651, A328252, A328310, A328320.
Cf. A328385 (the number found in the iteration).
Cf. A256750, A328248, A328383 for similar counts.

A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A051903(n) = if((n<=1),n-1,vecmax(factor(n)[, 2]));
A328384(n) = { my(d=A051903(n), u=A003415(n), k=1); if(u==n,return(0)); while(u && (u!=n) && !isprime(u) && A051903(u)==d, k++; n = u; u = A003415(u)); if(A051903(u)<=d,-k,k); };

a(1) = -1 as 0 is here considered having a smaller degree than 1.
a(p) = -1 for all primes.
a(A051674(n)) = 0.
a(A157037(n)) = -1.
a(A328252(n)) = -1.
a(A328320(n)) = -1.

A328302 For n > 1, a(n) is the least number > 0 for which it takes n-2 steps to reach a squarefree number by applying arithmetic derivative (A003415) zero or multiple times. a(1) = 4 is the least number for which no squarefree number is ever reached.

Original entry on oeis.org

4, 1, 9, 50, 306, 5831, 20230, 52283, 286891, 10820131, 38452606

Offset: 1

Antti Karttunen, Oct 12 2019

The least number k such that A328248(k) = n. After the initial two terms, probably also the positions of records in A328248, that is, it is conjectured that the records in A328248 appear in order, with each new record one larger than previous.

No other terms below 2^30.

			a(2) = 1 is the least number that is squarefree already at the "zeroth derivative".
52283 = 7^2 * 11 * 97 is not squarefree, and applying A003415 successively 1-6 times yields numbers 20230, 19431, 14250, 21175, 15345, 15189. Only the last one of these 15189 = 3*61*83 is squarefree, and there are no numbers < 52283 that would produce as long (6) finite chain of nonsquarefree numbers, thus a(2+6) = 52283.

The leftmost column in A328250.

Cf. A003415, A328248, A328320, A328321.

cp's OEIS Frontend

A328250 Square array A(n,k) read by descending antidiagonals where A(n,k) is the k-th solution x to A328248(x) = n-1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

A003415 a(n) = n' = arithmetic derivative of n: a(0) = a(1) = 0, a(prime) = 1, a(m*n) = m*a(n) + n*a(m).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

PARI

PARI

PARI

Python

Sage

Formula

Extensions

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

A328252 Numbers that are not squarefree, but whose arithmetic derivative (A003415) is.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

PARI

PARI

A328253 Nonsquarefree numbers whose first arithmetic derivative (A003415) is not squarefree, but the second derivative (A068346) is.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

PARI

PARI

A328251 Row 1 of array A328250: numbers n whose k-th arithmetic derivative is never squarefree for any k >= 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

A328305 Numbers that are cubefree, but not squarefree and whose first arithmetic derivative is not squarefree, but some k-th (with k >= 2) derivative is.

Views

Author

Keywords

Comments

Examples

A003415 a(n) = n' = arithmetic derivative of n: a(0) = a(1) = 0, a(prime) = 1, a(mn) = ma(n) + n*a(m).