The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A229850 Number of prime factors congruent to 1 mod 3 that divide the Fermat number 2^(2^n) + 1. 4
0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 3, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,11
COMMENTS
a(n) < A046052(n) because all Fermat numbers greater than 3 are equal to 2 (mod 3).
a(n) = 1 if A046052(n) = 2.
If A046052(n) = 3, then a(n) = 0 or 2.
a(n) <= A228846(n) - n - 1 for n = 0 to 11.
REFERENCES
M. Krizek, F. Luca, L. Somer, 17 Lectures on Fermat Numbers: From Number Theory to Geometry, CMS Books in Mathematics, vol. 9, Springer-Verlag, New York, 2001, pp. 61-63, 65-66.
LINKS
Wilfrid Keller, Fermat factoring status
Eric Weisstein's World of Mathematics, Fermat Number
CROSSREFS
Sequence in context: A036112 A266230 A134884 * A269162 A033909 A292240
KEYWORD
nonn,hard,more
AUTHOR
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 May 20 03:01 EDT 2024. Contains 372703 sequences. (Running on oeis4.)