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!)
A177876 a(n) is the number of distinct prime factors in Lucas-Lehmer numbers A003010(k-2)/(2^k-1), where k = A000043(n+1). 1
2, 3, 3, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(5) of this sequence will require the factorization of A003010(15), an 18742-digit integer divisible by 2^17-1.
LINKS
EXAMPLE
a(1)=2 because A003010(1)=14, contains exactly 2 distinct prime factors;
a(2)=3 because A003010(3)=37634, contains exactly 3 distinct prime factors;
a(3)=3 because A003010(5)=2005956546822746114, contains exactly 3 distinct prime factors;
a(4)=4 because A003010(11)=the associated 1172-digit Lucas-Lehmer number, contains exactly 4 distinct prime factors.
CROSSREFS
Sequence in context: A096393 A010120 A012887 * A079633 A285891 A060573
KEYWORD
nonn,hard,bref,more
AUTHOR
G. L. Honaker, Jr., Dec 13 2010
EXTENSIONS
Definition corrected by Max Alekseyev, Jul 29 2024
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 September 12 22:20 EDT 2024. Contains 375855 sequences. (Running on oeis4.)