|
%I #12 Oct 10 2019 15:56:06
%S 1,3,2,6,5,11,10,8,17,16,14,9,22,21,19,13,30,29,27,24,15,37,36,34,31,
%T 23,50,49,47,44,40,32,65,64,62,59,55,48,35,75,74,72,69,63,53,28,73,68,
%U 57,33,84,83,81,78,70,51,108,107,105,102,98,93,87,76,43,109,106,100,91,71
%N a(1)=1; for n>1, a(n) = the (a(n-1)(mod n)+1)-st integer from among those positive integers which do not occur earlier in the sequence.
%H Paul Tek, <a href="/A125675/b125675.txt">Table of n, a(n) for n = 1..10000</a>
%t f[l_List] := Block[{n = Length[l] + 1, k = 0, c = Mod[l[[ -1]], n] + 1},While[c > 0,k++;While[MemberQ[l, k], k++ ];c--;];Append[l, k]];Nest[f, {1}, 70] (* _Ray Chandler_, Feb 08 2007 *)
%K easy,nonn
%O 1,2
%A _Leroy Quet_, Jan 30 2007
%E Extended by _Ray Chandler_, Feb 08 2007
|
