A085731 Greatest common divisor of n and its arithmetic derivative.

1, 1, 1, 4, 1, 1, 1, 4, 3, 1, 1, 4, 1, 1, 1, 16, 1, 3, 1, 4, 1, 1, 1, 4, 5, 1, 27, 4, 1, 1, 1, 16, 1, 1, 1, 12, 1, 1, 1, 4, 1, 1, 1, 4, 3, 1, 1, 16, 7, 5, 1, 4, 1, 27, 1, 4, 1, 1, 1, 4, 1, 1, 3, 64, 1, 1, 1, 4, 1, 1, 1, 12, 1, 1, 5, 4, 1, 1, 1, 16, 27, 1, 1, 4, 1, 1, 1, 4, 1, 3, 1, 4, 1, 1, 1, 16

Offset

1,4

Comments

a(n) = 1 iff n is squarefree (A005117), cf. A068328.

This sequence is very probably multiplicative. - Mitch Harris, Apr 19 2005

Links

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

Victor Ufnarovski and Bo Ahlander, How to Differentiate a Number, J. Integer Seqs., Vol. 6, 2003, #03.3.4.

Formula

a(n) = GCD(n, A003415(n)).

Multiplicative with a(p^e) = p^e if p divides e; a(p^e) = p^(e-1) otherwise. - Eric M. Schmidt, Oct 22 2013

From Antti Karttunen, Feb 28 2021: (Start)

Thus a(A276086(n)) = A328572(n), by the above formula and the fact that A276086 is a permutation of A048103.

a(n) = n / A083346(n) = A190116(n) / A086130(n). (End)

Mathematica

d[0] = d[1] = 0; d[n_] := d[n] = n*Total[Apply[#2/#1 &, FactorInteger[n], {1}]]; a[n_] := GCD[n, d[n]]; Table[a[n], {n, 1, 96}] (* Jean-François Alcover, Feb 21 2014 *)
f[p_, e_] := p^If[Divisible[e, p], e, e - 1]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Oct 31 2023 *)

Prog

(Haskell)
a085731 n = gcd n $ a003415 n -- Reinhard Zumkeller, May 10 2011
(PARI) a(n) = {my(f = factor(n)); for (i=1, #f~, if (f[i, 2] % f[i, 1], f[i, 2]--); ); factorback(f); } \\ Michel Marcus, Feb 14 2016

Crossrefs

Cf. A003415, A005117, A048103, A068328, A083346, A083347, A086130, A129251, A189100, A189036, A189103, A190116, A276086, A327858, A327938, A328572, A340070.

Cf. A072873 (positions of records), A268398 (partial sums).

Sequence in context: A351230 A173675 A364360 * A131301 A350698 A335324

Adjacent sequences: A085728 A085729 A085730 * A085732 A085733 A085734

Keyword

nonn,easy,mult

Author

Reinhard Zumkeller, Jul 20 2003

Status

approved