cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A262518 Even bisection of A155043.

Original entry on oeis.org

0, 1, 2, 2, 3, 3, 3, 4, 5, 4, 5, 5, 6, 6, 6, 6, 7, 7, 10, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 11, 10, 12, 19, 12, 13, 13, 11, 14, 14, 14, 14, 15, 12, 16, 15, 15, 17, 16, 13, 18, 19, 17, 14, 18, 14, 18, 18, 19, 19, 20, 15, 21, 21, 20, 16, 22, 16, 23, 17, 23, 17, 24, 24, 25, 25, 24, 25, 26, 25, 27, 26, 26, 28, 27, 26, 27, 28, 28, 28, 29, 27, 29, 29
Offset: 0

Views

Author

Antti Karttunen, Oct 02 2015

Keywords

Comments

Number of steps needed to reach zero when starting from k = 2*n and repeatedly applying the map that replaces k by k - d(k), where d(k) is the number of divisors of k (A000005).

Crossrefs

Programs

Formula

a(n) = A155043(2*n).