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.

A118144 Numbers of prime factors of l, where l is defined in A118534.

Original entry on oeis.org

0, 0, 1, 0, 2, 2, 2, 2, 1, 3, 2, 2, 2, 2, 1, 1, 2, 2, 3, 2, 1, 3, 2, 4, 2, 3, 3, 3, 3, 3, 2, 3, 4, 2, 3, 2, 1, 2, 2, 1, 2, 3, 4, 4, 3, 2, 1, 2, 4, 4, 1, 2
Offset: 1

Views

Author

Rémi Eismann and Fabien Sibenaler, May 14 2006, Feb 14 2008

Keywords

Comments

a(n) = 0 only for n = 1, 2 and 4.

Examples

			For a(1), l=0 thus a(1)=0,
for a(3), l=3 thus a(3)=1,
for a(8), l=15=3*5 thus a(8)=2,
for a(24), l=81=3*3*3*3 thus a(24)=4.
		

Crossrefs

Formula

a(n) = numbers of factors of l, largest l such that prime(n+1) = prime(n) + (prime(n) mod l), or 0 if no such l exists.