|
%I #19 Feb 14 2019 01:52:11
%S 7,19,23,11,463,103,53,1237,571,101,5939,6599,239,313,95027,1223,
%T 1900543,281,43441,1699,2339131,2896067,1283,3229,3021983,5317369,
%U 389231411,32869,301999,2339,2154169,98383927,25015877,340939
%N Define b(0)=28, b(n+1)=2*b(n)+1; sequence gives largest prime factor of b(n).
%C a(k) = 29*2^k-1 for k in A050540. - _Robert Israel_, Nov 23 2016
%H Robert Israel, <a href="/A113972/b113972.txt">Table of n, a(n) for n = 0..250</a>
%F a(n) = A006530(29*2^n-1). - _Robert Israel_, Nov 23 2016
%e a(2)=23 because b(1) = 2*28 + 1 = 57 and b(2) = 2*57 + 1 = 115 = 5*23.
%p with(numtheory): b:=proc(n): if n=0 then 28 else 2*b(n-1)+1 fi: end: a:=proc(n) local bb: bb:=factorset(b(n)): bb[nops(bb)] end: seq(a(n),n=0..38); # _Emeric Deutsch_, May 14 2006
%Y Cf. A006530, A050540.
%K nonn
%O 0,1
%A _Bill McEachen_, Feb 06 2006
%E More terms from _Emeric Deutsch_, May 14 2006
|
