[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A083917 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A083917 Number of divisors of n that are congruent to 7 modulo 10.
(history; published version)
#14 by OEIS Server at Sat Dec 30 09:33:54 EST 2023
LINKS

Amiram Eldar, <a href="/A083917/b083917_1.txt">Table of n, a(n) for n = 1..10000</a>

#13 by Michael De Vlieger at Sat Dec 30 09:33:54 EST 2023
STATUS

reviewed

approved

Discussion
Sat Dec 30 09:33
OEIS Server: Installed first b-file as b083917.txt.
#12 by Joerg Arndt at Sat Dec 30 03:27:39 EST 2023
STATUS

proposed

reviewed

#11 by Amiram Eldar at Sat Dec 30 03:05:32 EST 2023
STATUS

editing

proposed

#10 by Amiram Eldar at Sat Dec 30 02:47:41 EST 2023
LINKS

Amiram Eldar, <a href="/A083917/b083917_1.txt">Table of n, a(n) for n = 1..10000</a>

#9 by Amiram Eldar at Sat Dec 30 02:47:07 EST 2023
LINKS

R. A. Smith and M. V. Subbarao, <a href="https://doi.org/10.4153/CMB-1981-005-3">The average number of divisors in an arithmetic progression</a>, Canadian Mathematical Bulletin, Vol. 24, No. 1 (1981), pp. 37-41.

FORMULA

Sum_{k=1..n} a(k) = n*log(n)/10 + c*n + O(n^(1/3)*log(n)), where c = gamma(7,10) - (1 - gamma)/10 = -0.150534..., gamma(7,10) = -(psi(7/10) + 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

a[n_] := DivisorSum[n, 1 &, Mod[#, 10] == 7 &]; Array[a, 100] (* Amiram Eldar, Dec 30 2023 *)

PROG

(PARI) a(n) = sumdiv(n, d, d % 10 == 7); \\ Amiram Eldar, Dec 30 2023

CROSSREFS

Cf. A010879, A000005, A001227, A010879.

Cf. A001620, A002392, A354643 (psi(7/10)).

Cf. A083910, A083911, A083912, A083913, A083914, A083915, A083916, A083918, A083919.

KEYWORD

nonn,easy

STATUS

approved

editing

#8 by Harvey P. Dale at Fri Sep 15 15:21:04 EDT 2023
STATUS

editing

approved

#7 by Harvey P. Dale at Fri Sep 15 15:21:00 EDT 2023
MATHEMATICA

Table[Count[Divisors[n], _?(Mod[#, 10]==7&)], {n, 110}] (* Harvey P. Dale, Sep 15 2023 *)

STATUS

approved

editing

#6 by Alois P. Heinz at Wed Sep 11 12:09:43 EDT 2019
STATUS

proposed

approved

#5 by Ilya Gutkovskiy at Wed Sep 11 12:09:00 EDT 2019
STATUS

editing

proposed

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 06:09 EDT 2024. Contains 375510 sequences. (Running on oeis4.)