OFFSET
1,6
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..7500 (first 1000 terms from Harry J. Smith)
MAPLE
a:= n-> add(`if`(i[2]>1, i[1], 0), i=ifactors(binomial(n, iquo(n, 2)))[2]):
seq(a(n), n=1..100); # Alois P. Heinz, Jun 24 2018
MATHEMATICA
a[n_] := Sum[If[i[[2]] > 1, i[[1]], 0], {i, FactorInteger[ Binomial[n, Quotient[n, 2]]]}];
Table[a[n], {n, 1, 100}] (* Jean-François Alcover, Mar 02 2022, after Alois P. Heinz *)
PROG
(PARI) { for (n=1, 1000, f=factor(binomial(n, n\2))~; a=0; for (i=1, length(f), if (f[2, i]>1, a+=f[1, i])); write("b064146.txt", n, " ", a) ) } \\ Harry J. Smith, Sep 09 2009
CROSSREFS
KEYWORD
nonn
AUTHOR
Labos Elemer, Sep 11 2001
STATUS
approved