|
| |
|
|
A130730
|
|
Fermat numbers of order 7 or F(n,7) = 2^(2^n)+7.
|
|
1
| |
|
|
9, 11, 23, 263, 65543, 4294967303, 18446744073709551623, 340282366920938463463374607431768211463, 115792089237316195423570985008687907853269984665640564039457584007913129639943
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| This sequence is equivelant to F(n)+ 6 or 2^(2^n)+ 1 + 6. This sequence does not appear to have any special divisibility properties. Fermat numbers of order 5 which are found in A063486, have the divisibility property if n is even, then 7 divides F(n,5). After the first 2 terms the ending digit is the same for all F(n,m) and is (6+m) mod 10.
|
|
|
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 in this nomenclature.
|
|
|
PROG
| (PARI) fplusm(n, m)= { local(x, y); for(x=0, n, y=2^(2^x)+m; print1(y", ") ) }
|
|
|
CROSSREFS
| Cf. A063486.
Sequence in context: A022323 A106525 A103510 * A153697 A129399 A145790
Adjacent sequences: A130727 A130728 A130729 * A130731 A130732 A130733
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Cino Hilliard (hillcino368(AT)hotmail.com), Jul 05 2007
|
| |
|
|
