login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A103479 Positive integers k for which 1 + 6*2^(k+2) divides the Fermat number 1 + 2^2^k. 2
38, 2478782 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

On Keller's linked page, to find the terms, you run through the tables and find all rows with k = 3 and with n exactly 3 greater than m, then that m belongs to this sequence. - Jeppe Stig Nielsen, Dec 04 2018

LINKS

Table of n, a(n) for n=1..2.

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

EXAMPLE

a(1)=38 because 38 is the smallest positive integer k for which 1 + 6*2^(k+2) divides the Fermat number 1 + 2^2^k.

MATHEMATICA

aQ[n_] := PowerMod[2, 2^n, 1 + 6*2^(n+2)] == 6*2^(n+2); Select[Range[3000000], aQ] (* Amiram Eldar, Dec 04 2018 *)

PROG

(PARI) isOK(n) = Mod(2, 1+3*2^(n+3))^(2^n) + 1 == 0 \\ Jeppe Stig Nielsen, Dec 03 2018

CROSSREFS

Cf. A103477, A103478.

Sequence in context: A134182 A110017 A181016 * A036174 A162458 A097439

Adjacent sequences:  A103476 A103477 A103478 * A103480 A103481 A103482

KEYWORD

nonn,bref,hard,more

AUTHOR

Serhat Sevki Dincer (mesti_mudam(AT)yahoo.com), Feb 07 2005

EXTENSIONS

Sequence name trimmed by Jeppe Stig Nielsen, Dec 03 2018

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 18 04:48 EST 2020. Contains 332011 sequences. (Running on oeis4.)