|
%I #13 Dec 10 2021 07:24:03
%S 1,4,2,6,3,8,5,9,7,10,11,12,13,14,17,15,23,16,25,18,29,19,37,20,41,21,
%T 43,22,47,24,53,26,61,27,67,28,71,30,77,31,83,32,89,33,91,34,97,35,
%U 107,36,115,38,119,39,121,40,127,42,131,44,143,45,149,46,157
%N Ludic and non-ludic numbers interleaved.
%C a(2*n-1) = A003309(n); a(2*n) = A192607(n);
%C integer permutation with inverse A237058.
%H Reinhard Zumkeller, <a href="/A237056/b237056.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%t a3309[nmax_] := a3309[nmax] = Module[{t = Range[2, nmax], k, r = {1}}, While[Length[t] > 0, k = First[t]; AppendTo[r, k]; t = Drop[t, {1, -1, k}]]; r];
%t nmax = 1000;
%t Riffle[a3309[nmax], Complement[Range[nmax], a3309[nmax]]] (* _Jean-François Alcover_, Dec 10 2021, after _Ray Chandler_ in A003309 *)
%o (Haskell)
%o import Data.List (transpose)
%o a237056 n = a237056_list !! (n-1)
%o a237056_list = concat $ transpose [a003309_list, a192607_list]
%Y Cf. A073846.
%K nonn
%O 1,2
%A _Antti Karttunen_ and _Reinhard Zumkeller_, Feb 04 2014
|
