|
|
A359306
|
|
Number of divisors of 6*n-2 of form 6*k+1.
|
|
5
|
|
|
1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 1, 2, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 1, 1, 2, 3, 1, 2, 1, 2, 1, 1, 2, 2, 2, 1, 1, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 1, 1, 2, 1, 1, 1, 4, 2, 1, 1, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 1, 1, 1, 2, 3, 2, 1, 2, 1, 2, 1, 4, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
LINKS
|
|
|
FORMULA
|
G.f.: Sum_{k>0} x^k/(1 - x^(6*k-2)).
G.f.: Sum_{k>0} x^(4*k-3)/(1 - x^(6*k-5)).
|
|
MATHEMATICA
|
a[n_] := DivisorSum[6*n-2, 1 &, Mod[#, 6] == 1 &]; Array[a, 100] (* Amiram Eldar, Aug 16 2023 *)
|
|
PROG
|
(PARI) a(n) = sumdiv(6*n-2, d, d%6==1);
(PARI) my(N=100, x='x+O('x^N)); Vec(sum(k=1, N, x^k/(1-x^(6*k-2))))
(PARI) my(N=100, x='x+O('x^N)); Vec(sum(k=1, N, x^(4*k-3)/(1-x^(6*k-5))))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|