login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) is the smallest prime divisor of (A177929(n)-1)*(A177929(n)+1).
6

%I #10 May 13 2023 05:51:41

%S 3,5,3,11,3,5,3,29,3,59,3,7,5,3,7,137,3,5,3,281,3,5,3,569,3,7,5,3,

%T 1151,3,5,3,2309,3,31,4649,3,17,3,7,5,3,7,5,3,9341,3,5,3,11,3,59,3,29,

%U 3,19,7,5,3,7,19,5,3,7,109,5,3,61,7,79,5,3,13,5,3,19139,3,101,3,7,13,11,3,71,3

%N a(n) is the smallest prime divisor of (A177929(n)-1)*(A177929(n)+1).

%C Records are in A177932, their positions in A177931.

%F a(n) = A020639( (A177929(n))^2 -1 ).

%t lpf[n_] := FactorInteger[n][[1, 1]];

%t b[n_] := b[n] = If[n == 1, 4, b[n-1]+lpf[b[n-1]^2-1]-1];

%t a[n_] := lpf[b[n]^2-1];

%t Table[a[n], {n, 1, 85}] (* _Jean-François Alcover_, May 13 2023 *)

%Y Cf. A001359, A020639, A177929, A174514, A174216, A174217

%K nonn

%O 1,1

%A _Vladimir Shevelev_, May 15 2010

%E A 7 replaced by 17 and sequence extended by _R. J. Mathar_, May 31 2010