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.

A029911 Start with n; if prime, skip; repeatedly sum prime factors (counted with multiplicity) and add 1, until reach 1, 6 or a prime.

Original entry on oeis.org

1, 5, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 11, 7, 7, 11, 7, 7, 7, 11, 11, 7, 7, 13, 11, 7, 17, 7, 13, 7, 7, 7, 7, 7, 13, 11, 7, 7, 17, 7, 23, 11, 13, 7, 7, 13, 19, 17, 7, 7, 7, 13, 7, 7, 7, 19, 19, 7, 13, 7, 7, 23, 7, 7, 7, 7, 11, 7, 13, 13, 11, 7, 17, 7, 7, 23, 7, 7, 7, 7, 19, 41, 7
Offset: 1

Views

Author

Keywords

Examples

			20 -> 2+2+5+1 = 10 -> 2+5+1 = 8 -> 2+2+2+1 = 7.
		

Crossrefs

Cf. A029910.