OFFSET
1,8
LINKS
Clark Kimberling, Table of n, a(n) for n = 1..1000
EXAMPLE
a(16) counts these divisors of 16!: 1^6, 2^6, 2^12, 3^6, 6^6, 12^6.
MATHEMATICA
z = 130; m = 6;
f[n_] := f[n] = FactorInteger[n!]; r[x_] := r[x] = m*Floor[x/m]
u[n_] := Table[f[n][[i, 1]], {i, 1, Length[f[n]]}];
v[n_] := Table[f[n][[i, 2]], {i, 1, Length[f[n]]}];
a[n_] := Apply[Times, 1 + r[v[n]]/m]
t = Table[a[n], {n, 1, z}] (* A248783 *)
PROG
(PARI) a(n)=c=0; d=divisors(n!); for(i=1, #d, if(ispower(d[i])&&ispower(d[i])%6==0, c++)); c+1
n=1; while(n<50, print1(a(n), ", "); n++) \\ Derek Orr, Oct 20 2014
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Oct 15 2014
STATUS
approved