login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A083916
Number of divisors of n that are congruent to 6 modulo 10.
11
0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 2, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 2, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0, 0, 2, 0, 0, 0, 1, 0, 2, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 3, 0, 0, 0, 0, 0, 1, 0, 1, 0
OFFSET
1,36
LINKS
R. A. Smith and M. V. Subbarao, The average number of divisors in an arithmetic progression, Canadian Mathematical Bulletin, Vol. 24, No. 1 (1981), pp. 37-41.
FORMULA
a(n) = A000005(n) - A083910(n) - A083911(n) - A083912(n) - A083913(n) - A083914(n) - A083915(n) - A083917(n) - A083918(n) - A083919(n).
G.f.: Sum_{k>=1} x^(6*k)/(1 - x^(10*k)). - Ilya Gutkovskiy, Sep 11 2019
Sum_{k=1..n} a(k) = n*log(n)/10 + c*n + O(n^(1/3)*log(n)), where c = gamma(6,10) - (1 - gamma)/10 = -0.118475..., gamma(6,10) = -(psi(3/5) + log(10))/10 is a generalized Euler constant, and gamma is Euler's constant (A001620) (Smith and Subbarao, 1981). - Amiram Eldar, Dec 30 2023
MATHEMATICA
Table[Count[Divisors[n], _?(Mod[#, 10]==6&)], {n, 110}] (* Harvey P. Dale, Oct 16 2013 *)
a[n_] := DivisorSum[n, 1 &, Mod[#, 10] == 6 &]; Array[a, 100] (* Amiram Eldar, Dec 30 2023 *)
PROG
(PARI) a(n) = sumdiv(n, d, d % 10 == 6); \\ Amiram Eldar, Dec 30 2023
KEYWORD
nonn,easy
AUTHOR
Reinhard Zumkeller, May 08 2003
STATUS
approved