0,1

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.

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.

(PARI) fplusm(n, m)= { local(x, y); for(x=0, n, y=2^(2^x)+m; print1(y", ") ) }

Cf. A063486.

Sequence in context: A022323 A106525 A103510 this_sequence A129399 A116152 A108687

Adjacent sequences: A130727 A130728 A130729 this_sequence A130731 A130732 A130733

nonn

Cino Hilliard (hillcino368(AT)hotmail.com), Jul 05 2007