[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Search: a229857 -id:a229857
Displaying 1-1 of 1 result found.
page 1
     Sort: relevance | references | number | modified | created      Format: long | short | data
A283051
Positive integers n such that none of the primes of the form k*2^n + 1 (with k odd) divide any Fermat number F(m) = 2^(2^m) + 1, m >= 0.
+10
0
3, 5, 6, 10
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Conjecture: sequence is infinite.
a(5) >= 18.
LINKS
Table of n, a(n) for n=1..4.
Proth Search Page, Prime factors of Fermat numbers
Eric Weisstein's World of Mathematics, Fermat Number
CROSSREFS
Cf. A019434, A023394, A228845, A228846, A229857, A231203.
KEYWORD
nonn,hard,more
AUTHOR
Arkadiusz Wesolowski, Feb 27 2017
STATUS
approved
page 1

Search completed in 0.005 seconds

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified November 7 14:11 EST 2024. Contains 377535 sequences.
License Agreements, Terms of Use, Privacy Policy