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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A332416 Positive integers r such that B(1,r) = B(2,r - 1) = ... = B(r,1) = 0, where B denotes the function mapping every pair of positive integers (m,n) into 1 if m * 2^(n + 2) + 1 is a prime number dividing F(n), where F(n) denotes the n-th Fermat number (i.e., F(n) = A000215(n)); and into 0 otherwise. 2
 1, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 15, 16, 17, 19, 20, 21, 22, 23, 24, 25, 26, 28, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 44, 46, 47, 48, 50, 51, 52, 53, 54, 55, 56, 57, 58, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 78, 79 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Note that A332414 is a subsequence of this sequence. Prime q = m*2^(n + 2) + 1 does not divide ((F(n + 2) - 1)^m - 1)/F(n) if and only if q divides F(n). Direct implication is Theorem 2.24 of my article (see the links). Proof of the reciprocal implication (by Wang): A001146(n) = 2^(2^n) == - 1 (mod q), so ((F(n + 2) - 1)^m - 1)/F(n) = Sum_{i = 0..4*m-1} (-1)^(i+1)*(2^(2^n))^i == -4*m (mod q). LINKS Lorenzo Sauras Altuzarra, Some arithmetical problems that are obtained by analyzing proofs and infinite graphs, arXiv:2002.03075 [math.NT], 2020. EXAMPLE 3 is a term of this sequence, because B(1,3) = B(2,2) = B(3,1) = 0. MAPLE A332416:=proc(n)    local c, i, k, q, r, v:    c:=0:    i:=0:    r:=1:    while c < n do       for k from 0 to r-1 do          q:=(k+1)*2^(r-k+2)+1:          if not isprime(q) or (2^(2^(r-k)) + 1) mod q != 0 then             i:=i+1:          fi:       od:       if i = r then          v:=r:          c:=c+1:       fi:       i:=0:       r:=r+1:    od:    return v: end proc: MATHEMATICA Select[Range@ 29, NoneTrue[Transpose@ {#, Reverse@ #} &@ Range@ #, And[PrimeQ[#4], Mod[((#3 - 1)^#1 - 1)/(2^(2^#2) + 1), #4] != 0] & @@ {#1, #2, 2^(2^(#2 + 2)) + 1, #1*2^(#2 + 2) + 1} & @@ # &] &] (* Michael De Vlieger, Feb 14 2020 *) PROG (PARI) isB(m, t) = ispseudoprime(q=4*m*2^t+1) && Mod(2, q)^(2^t)==-1; isok(r) = sum(i=1, r, isB(i, r-i+1)) == 0; \\ Jinyuan Wang, Feb 18 2020 CROSSREFS Cf. A000215 (Fermat numbers), A001146, A332414. Sequence in context: A207669 A001272 A273664 * A047563 A261604 A120561 Adjacent sequences:  A332413 A332414 A332415 * A332417 A332418 A332419 KEYWORD nonn AUTHOR Lorenzo Sauras Altuzarra, Feb 12 2020 EXTENSIONS a(25)-a(68) from Jinyuan Wang, Feb 18 2020 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.

Last modified August 6 12:33 EDT 2020. Contains 336246 sequences. (Running on oeis4.)