login
This site is supported by donations to The OEIS Foundation.

 

Logo

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007117 a(n)*2^(n+2) + 1 divides n-th Fermat number.
(Formerly M4586)
3
0, 0, 1, 8, 1024, 5, 1071, 116503103764643, 1209889024954, 1184, 11131, 39, 7, 82731770, 1784180997819127957596374417642156545110881094717, 9264, 3150, 59251857, 13, 33629 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

REFERENCES

P. Ribenboim, The Book of Prime Number Records. Springer-Verlag, NY, 2nd ed., 1989, p. 71.

H. Riesel, ``Prime numbers and computer methods for factorization,'' Progress in Mathematics, Vol. 57, Birkhauser, Boston, 1985, Chap. 4, see p. 377.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=0..19.

Wilfrid Keller, Prime factors k.2^n + 1 of Fermat numbers F_m

CROSSREFS

Sequence in context: A046242 A260028 A176367 * A085533 A122067 A076688

Adjacent sequences:  A007114 A007115 A007116 * A007118 A007119 A007120

KEYWORD

hard,nonn

AUTHOR

N. J. A. Sloane, Robert G. Wilson v

EXTENSIONS

a(14)-a(19) added by Max Alekseyev, May 04 2010

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified May 27 16:49 EDT 2017. Contains 287207 sequences.