|
Search: id:A130729
|
|
|
| A130729 |
|
Fermat numbers of order 3 or F(n,3) = 2^(2^n)+3. |
|
+0
2
|
|
| 5, 7, 19, 259, 65539, 4294967299, 18446744073709551619, 340282366920938463463374607431768211459, 115792089237316195423570985008687907853269984665640564039457584007913129639939
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
This is equivelant to F(n)+2 or 2^(2^n)+ 1 + 2. Conjecture: If n is odd, 7 is a divisor of F(n,3). This is equivelant to 7 divides 4^(4^m) +3 for all m. Subtracting 7 we get 7 divides 4^(4^m)-4 or 7 divides 4^(4^m-1)-1 for all m.
|
|
FORMULA
|
F(n,m): The n-th Fermat number of order m = 2^(2^n)+ m. The traditional Fermat numbers are F(n,1) or Fermat numbers of order 1.
|
|
PROGRAM
|
(PARI) fplusm(n, m)= { local(x, y); for(x=0, n, y=2^(2^x)+m; print1(y", ") ) }
|
|
CROSSREFS
|
Sequence in context: A096636 A101588 A062654 this_sequence A117321 A120035 A091154
Adjacent sequences: A130726 A130727 A130728 this_sequence A130730 A130731 A130732
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)hotmail.com), Jul 05 2007
|
|
|
Search completed in 0.002 seconds
|
