login
a(1) = 1; for n>=2, a(n) = A001221(n)-th positive integer not yet in the sequence.
4

%I #12 Sep 25 2017 04:10:59

%S 1,2,3,4,5,7,6,8,9,11,10,13,12,15,16,14,17,19,18,21,22,23,20,25,24,27,

%T 26,29,28,32,30,31,34,35,36,37,33,39,40,41,38,44,42,45,46,47,43,49,48,

%U 51,52,53,50,55,56,57,58,59,54,62,60,63,64,61,66,68,65,69,70,72,67,73

%N a(1) = 1; for n>=2, a(n) = A001221(n)-th positive integer not yet in the sequence.

%C A permutation of the positive integers.

%H Michael De Vlieger, <a href="/A100806/b100806.txt">Table of n, a(n) for n = 1..30030</a>

%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>

%t Block[{a = {1}, nn = 72, s, P = FoldList[Times, Prime@ Range@ 12]}, s = Range[2, nn + LengthWhile[P, # <= nn &]]; Do[AppendTo[a, s[[PrimeNu@ i ]]]; s = Complement[s, a], {i, 2, nn}]; a] (* _Michael De Vlieger_, Sep 24 2017 *)

%Y Cf. A001221, A101212.

%Y Inverse: A102451; A102450(n) = a(a(n)).

%Y Cf. A102452.

%K nonn

%O 1,2

%A _Leroy Quet_, Jan 04 2005

%E More terms from _Reinhard Zumkeller_, Jan 09 2005