cp's OEIS Frontend

A187063 Numbers of the form (4^k - 1)/3 whose greatest prime divisor is of the form 2^q - 1 or 2^q + 1.

%I A187063 #19 Mar 02 2020 09:38:48
%S A187063 5,21,85,341,5461,21845,22369621,89478485,1431655765,5726623061,
%T A187063 91625968981,1501199875790165,1537228672809129301,
%U A187063 98382635059784275285,1690200800304305868662270940501,1772303994379887830538409413707126101
%N A187063 Numbers of the form (4^k - 1)/3 whose greatest prime divisor is of the form 2^q - 1 or 2^q + 1.
%C A187063 The binary expansion of (4^k-1)/3 has no consecutive equal binary digits.
%C A187063 The corresponding values of k are 2, 3, 4, 5, 7, 8, 13, 14, 16, 17, 19, 26, 31, 34, 51, 61, 62, 89, 107, 122, 127, 178, 214, 254, 521, ... - _Amiram Eldar_, Mar 02 2020
%H A187063 Amiram Eldar, <a href="/A187063/b187063.txt">Table of n, a(n) for n = 1..25</a>
%e A187063 (4^6-1)/3 = 1365 = 3 * 5 * 7 * 13 is not in the sequence because  13 is not of the form 2^q +/- 1 ;
%e A187063 (4^16-1)/3 = 1431655765 = 5 * 17 * 257 * 65537 and 65537 = 2^16 + 1.
%p A187063 with(numtheory):
%p A187063 a:= proc(n) option remember; local k, t, d, h;
%p A187063       for k from 1+ `if`(n=1, 0, ilog[4](a(n-1)*3+1))
%p A187063       do t:= (4^k-1)/3;
%p A187063          d:= max(factorset(t)[]);
%p A187063          for h in [d+1, d-1] do
%p A187063             if 2^ilog[2](h)=h then RETURN(t) fi
%p A187063          od
%p A187063       od
%p A187063     end:
%p A187063 seq(a(n), n=1..17);  # _Alois P. Heinz_, Mar 04 2011
%t A187063 okQ[n_] := Module[{p = FactorInteger[n][[-1, 1]]}, IntegerQ[Log[2, p + 1]] || IntegerQ[Log[2, p - 1]]]; t = Table[(4^n-1)/3, {n,2,50}]; Select[t, okQ] (* _T. D. Noe_, Mar 04 2011 *)
%Y A187063 Cf. A002450 ((4^n-1)/3), A274906.
%K A187063 nonn
%O A187063 1,1
%A A187063 _Michel Lagneau_, Mar 03 2011