login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086131 Largest prime factor of arithmetic derivative of n if it exists, or a(n)=0 for n=1 and n=prime. 2
0, 0, 0, 2, 0, 5, 0, 3, 3, 7, 0, 2, 0, 3, 2, 2, 0, 7, 0, 3, 5, 13, 0, 11, 5, 5, 3, 2, 0, 31, 0, 5, 7, 19, 3, 5, 0, 7, 2, 17, 0, 41, 0, 3, 13, 5, 0, 7, 7, 5, 5, 7, 0, 3, 2, 23, 11, 31, 0, 23, 0, 11, 17, 3, 3, 61, 0, 3, 13, 59, 0, 13, 0, 13, 11, 5, 3, 71, 0, 11, 3, 43, 0, 31, 11, 5, 2, 7, 0, 41, 5, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Floris P. van Doorn and Jasper Mulder, Table of n, a(n) for n = 1..20000

MAPLE

with(numtheory):

d:= n-> n*add(i[2]/i[1], i=ifactors(n)[2]):

a:= n-> (f-> `if`(f<2, 0, max(factorset(f)[])))(d(n)):

seq(a(n), n=1..105);  # Alois P. Heinz, Jun 08 2015

MATHEMATICA

d[n_] := n*Sum[i[[2]]/i[[1]], {i, FactorInteger[n]}];

a[n_] := Function[f, If[f<2, 0, Max[FactorInteger[f][[All, 1]]]]][d[n]];

Table[a[n], {n, 1, 105}] (* Jean-Fran├žois Alcover, Mar 23 2017, after Alois P. Heinz *)

CROSSREFS

Cf. A003415.

Sequence in context: A058974 A326059 A019962 * A318889 A319853 A228620

Adjacent sequences:  A086128 A086129 A086130 * A086132 A086133 A086134

KEYWORD

nonn

AUTHOR

Labos Elemer, Jul 23 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 22 16:31 EST 2019. Contains 329396 sequences. (Running on oeis4.)