login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A118144 Numbers of prime factors of l, where l is defined in A118534. 2
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
COMMENTS
a(n) = 0 only for n = 1, 2 and 4.
LINKS
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.
EXAMPLE
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
Sequence in context: A192056 A207385 A306242 * A136691 A361199 A231168
KEYWORD
nonn
AUTHOR
Rémi Eismann and Fabien Sibenaler, May 14 2006, Feb 14 2008
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 11:08 EDT 2024. Contains 371711 sequences. (Running on oeis4.)