Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A234306

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
a(n) = n + 1 - d(2n), where d(n) is the number of divisors of n.
(history; published version)
#24 by Wesley Ivan Hurt at Thu Jun 24 21:09:31 EDT 2021
STATUS

editing

approved

#23 by Wesley Ivan Hurt at Thu Jun 24 21:08:05 EDT 2021
COMMENTS

Number of positive integers k <= n, such that k does not divide 2n-k. For example, a(12) = 5 since there are 5 positive integers k less than or equal to 12 that do not divide 2*12-k. They are 5, 7, 9, 10, and 11. - Wesley Ivan Hurt, Jun 24 2021

STATUS

approved

editing

#22 by Bruno Berselli at Tue Feb 06 12:09:10 EST 2018
STATUS

reviewed

approved

#21 by Michel Marcus at Mon Feb 05 04:25:50 EST 2018
STATUS

proposed

reviewed

#20 by Muniru A Asiru at Sun Feb 04 16:52:22 EST 2018
STATUS

editing

proposed

#19 by Muniru A Asiru at Sun Feb 04 16:52:03 EST 2018
LINKS

Muniru A Asiru, <a href="/A234306/b234306.txt">Table of n, a(n) for n = 1..5000</a>

PROG

(GAP) List([1..10^4], n->n+1-Tau(2*n)); # Muniru A Asiru, Feb 04 2018

STATUS

proposed

editing

#18 by Jon E. Schoenfield at Sun Feb 04 15:44:26 EST 2018
STATUS

editing

proposed

#17 by Jon E. Schoenfield at Sun Feb 04 15:44:23 EST 2018
FORMULA

a(n) = sum_Sum_{i=1..n | i does not divide 2n-i} 1.

STATUS

reviewed

editing

#16 by Michel Marcus at Sun Feb 04 15:19:40 EST 2018
STATUS

proposed

reviewed

#15 by Wesley Ivan Hurt at Sun Feb 04 11:48:06 EST 2018
STATUS

editing

proposed