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.

A175128 a(n) = the number of natural numbers m with n steps of iterations of {r - (smallest prime divisor of r)} needed to reach 0 starting at r = m .

Original entry on oeis.org

1, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 3
Offset: 2

Views

Author

Jaroslav Krizek, Feb 15 2010

Keywords

Comments

Examples

			Example (a(7)=2): There are two natural numbers 14 and 15 with 7 steps in this iteration. 14-2=12, 12-2=10, 10-2=8, 8-2=6, 6-2=4, 4-2=2, 2-2=0; 15-3=12, 12-2=10, 10-2=8, 8-2=6, 6-2=4, 4-2=2, 2-2=0.