|
%I #5 Oct 08 2019 22:21:25
%S 1,2,4,3,6,5,8,7,9,11,10,12,13,14,16,15,17,18,19,20,21,23,22,24,25,27,
%T 26,28,29,30,31,32,33,36,34,37,35,40,38,41,39,42,43,44,46,45,47,48,49,
%U 50,51,52,53,54,55,56,57,59,58,60,61,62,63,64,65,66,67
%N Permutation of positive integers: a(1) = 1. For n > 1, a(n) is the smallest positive integer not already in the sequence such that bigomega(a(n)) != bigomega(a(n-1)), where bigomega(i) is A001222(i).
%o (PARI) my(v=[1], terms=40); print1(1, ", "); while(1, if(#v > terms-1, break); for(k=1, oo, if(bigomega(k)!=bigomega(v[#v]) && !setsearch(vecsort(v), k), print1(k, ", "); v=concat(v, k); break)))
%Y Cf. A001222, A328048, A328049, A328050.
%K nonn,easy
%O 1,2
%A _Felix Fröhlich_, Oct 03 2019
|
