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”).
%I #9 Aug 01 2015 10:30:04
%S 1,3,8,15,23,35,48,61,80,99,119,143,168,193,224,255,287,323,360,397,
%T 440,483,527,575,624,673,728,783,839,899,960,1021,1088,1155,1223,1295,
%U 1368,1441,1520,1599,1679,1763,1848,1933,2024,2115,2207,2303,2400,2497,2600
%N a(1)=1. a(n) = the largest integer coprime to a(n-1) and less than n^2.
%t a[n_] := a[n] = Block[{k = n^2 - 1}, While[ GCD[k, a[n - 1]] > 1, k-- ]; k]; a[1] = 1; Array[a, 55] (* _Robert G. Wilson v_, May 04 2009 *)
%Y Cf. A157421, A157604, A157605.
%K nonn
%O 1,2
%A _Leroy Quet_, Mar 02 2009
%E More terms from _Robert G. Wilson v_, May 04 2009