|
|
A363808
|
|
Number of divisors of n of the form 7*k + 6.
|
|
11
|
|
|
0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 2, 0, 0, 0, 1, 0, 2, 1, 0, 0, 0, 0, 2, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 2, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 2, 1, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,48
|
|
LINKS
|
|
|
FORMULA
|
G.f.: Sum_{k>0} x^(6*k)/(1 - x^(7*k)).
G.f.: Sum_{k>0} x^(7*k-1)/(1 - x^(7*k-1)).
Sum_{k=1..n} a(k) = n*log(n)/7 + c*n + O(n^(1/3)*log(n)), where c = gamma(6,7) - (1 - gamma)/7 = -0.218328..., gamma(6,7) = -(psi(6/7) + log(7))/7 is a generalized Euler constant, and gamma is Euler's constant (A001620) (Smith and Subbarao, 1981). - Amiram Eldar, Nov 25 2023
|
|
MATHEMATICA
|
a[n_] := DivisorSum[n, 1 &, Mod[#, 7] == 6 &]; Array[a, 100] (* Amiram Eldar, Jun 23 2023 *)
|
|
PROG
|
(PARI) a(n) = sumdiv(n, d, d%7==6);
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|