login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A260619 Arithmetic derivative of hyperfactorial(n). 2
0, 0, 4, 216, 165888, 604800000, 48372940800000, 43156963184025600000, 1392410948543163924480000000, 668916177911197542484208831692800000, 8199617664717905359483850194944000000000000000, 2401010998878767104110478543683244630474752000000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = A003415(A002109(n)).
a(n) = A002109(n)*A190121(n) (conjectured).
MAPLE
h:= proc(n) option remember; `if`(n=0, 1, h(n-1)* n^n) end:
a:= proc(n) n^n *`if`(n=0, 0,
a(n-1)+h(n-1)*n*add(i[2]/i[1], i=ifactors(n)[2]))
end:
seq(a(n), n=0..15); # Alois P. Heinz, Sep 18 2015
MATHEMATICA
a[n_] := If[n<2, 0, With[{h = Hyperfactorial[n]}, h Sum[{p, e} = pe; e/p, {pe, FactorInteger[h]}]]];
a /@ Range[0, 15] (* Jean-François Alcover, Nov 14 2020 *)
PROG
(Python 3.8+)
from math import prod
from collections import Counter
from sympy import factorint
def A260619(n):
s = prod(i**i for i in range(2, n+1))
return sum(s*e//p for p, e in sum(((lambda x: Counter({k:x[k]*m for k in x}))(factorint(m)) for m in range(2, n+1)), start=Counter({2:0})).items()) if n > 1 else 0 # Chai Wah Wu, Jun 12 2022
CROSSREFS
Sequence in context: A276487 A269283 A055627 * A167888 A371204 A036740
KEYWORD
nonn
AUTHOR
Matthew Campbell, Sep 17 2015
EXTENSIONS
More terms from Alois P. Heinz, Sep 18 2015
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 13:11 EDT 2024. Contains 371913 sequences. (Running on oeis4.)