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.

A053470 a(n) is the cototient of n (A051953) iterated twice.

Original entry on oeis.org

0, 0, 0, 1, 0, 2, 0, 2, 1, 4, 0, 4, 0, 4, 1, 4, 0, 8, 0, 8, 3, 8, 0, 8, 1, 8, 3, 8, 0, 12, 0, 8, 1, 12, 1, 16, 0, 12, 7, 16, 0, 22, 0, 16, 9, 16, 0, 16, 1, 22, 1, 16, 0, 24, 7, 16, 9, 22, 0, 24, 0, 16, 9, 16, 1, 24, 0, 24, 5, 24, 0, 32, 0, 20, 11, 24, 1, 36, 0, 32, 9, 30, 0, 44, 9, 24, 1, 32, 0
Offset: 1

Views

Author

Labos Elemer, Jan 14 2000

Keywords

Comments

Iteration of A051953 is ended at fixed point 0. Analogous 2nd iterates for number of divisors (A000005) and Euler-Phi (A000010) are A036454 and A010554.

Examples

			n=50, n_1 = n - phi(n) = 50 - 20 = 30, n_2 = n_1 - Phi(n_1) = 30 - 8 = 22, so the 50th term is 22.
		

Crossrefs

Programs

Formula

a(1) = 0; for n > 1, a(n) = A051953(A051953(n)).