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”).

A262519
Odd bisection of A155043.
7
1, 2, 3, 4, 3, 4, 5, 5, 6, 7, 7, 8, 6, 9, 10, 11, 11, 12, 13, 13, 14, 15, 14, 15, 10, 16, 17, 17, 18, 19, 20, 19, 21, 22, 22, 23, 24, 23, 25, 26, 15, 16, 16, 17, 18, 18, 19, 19, 20, 20, 21, 22, 21, 22, 23, 23, 24, 24, 24, 25, 21, 26, 22, 23, 23, 24, 24, 24, 25, 26, 26, 27, 27, 27, 28, 29, 28, 30, 31, 31, 32, 33, 32, 33, 28, 33, 34, 29, 35, 36, 37, 37
OFFSET
0,2
COMMENTS
Number of steps needed to reach zero when starting from k = 2*n + 1 and repeatedly applying the map that replaces k by k - d(k), where d(k) is the number of divisors of k (A000005).
FORMULA
a(n) = A155043(2*n + 1).
MATHEMATICA
Table[Length[NestWhileList[#-DivisorSigma[0, #]&, n, #!=0&]]-1, {n, 1, 200, 2}] (* Harvey P. Dale, Aug 31 2017 *)
PROG
(Scheme) (define (A262519 n) (A155043 (+ n n 1)))
KEYWORD
nonn
AUTHOR
Antti Karttunen, Oct 02 2015
STATUS
approved