OFFSET
1,3
COMMENTS
A061396(n) is the number of times n appears in this sequence.
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Jon Awbrey, Illustrations of riffs for small integers.
Jon Awbrey, Riffs and Rotes.
FORMULA
a(Product(p_i^e_i)) = Sum(a(i)+a(e_i)+1), product over nonzero e_i in prime factorization.
a(n) = Sum_{k=1..A001221(n)} (a(A049084(A027748(n,k))) + a(A124010(n,k)) + 1). - Reinhard Zumkeller, Feb 26 2013
MATHEMATICA
a[1] = 0; a[n_] := a[n] = Sum[{p, e} = pe; a[PrimePi[p]] + a[e] + 1, {pe, FactorInteger[n]}]; Array[a, 105] (* Jean-François Alcover, Jul 26 2019 *)
PROG
(Haskell)
import Data.Function (on)
a062537 1 = 0
a062537 n = sum $ map (+ 1) $
zipWith ((+) `on` a062537) (map a049084 $ a027748_row n) (a124010_row n)
-- Reinhard Zumkeller, Feb 26 2013
CROSSREFS
KEYWORD
nonn,easy,nice
AUTHOR
David W. Wilson, Jun 25 2001
STATUS
approved