id:A007117 - OEIS Search Results

Search: id:A007117

Displaying 1-1 of 1 results found.

page 1

a(n)*2^(n+2) + 1 divides n-th Fermat number.
(Formerly M4586)

+0
1

0, 0, 1, 8, 1024, 5, 1071, 116503103764643, 1209889024954, 1184, 11131, 39, 7, 82731770 (list; graph; listen)

	OFFSET	`0,4`
	REFERENCES	`N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).` `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.
	LINKS	`Wilfrid Keller, Prime factors k.2^n + 1 of Fermat numbers F_m`
	CROSSREFS	`Sequence in context: A164883 A019545 A046242 this_sequence A085533 A122067 A076688` `Adjacent sequences: A007114 A007115 A007116 this_sequence A007118 A007119 A007120`
	KEYWORD	`hard,nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Robert G. Wilson v (rgwv(AT)rgwv.com)`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.