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 #12 Dec 02 2016 14:32:52
%S 2,3,1,6,4,7,5,10,8,11,9,14,12,15,13,18,16,19,17,22,20,23,21,26,24,27,
%T 25,30,28,31,29,34,32,35,33,38,36,39,37,42,40,43,41,46,44,47,45,50,48,
%U 51,49,54,52,55,53,58,56,59,57,62,60,63,61,66,64,67
%N Permutation of natural numbers generated by 2-rowed array shown below.
%C 2 3 6 7 10 11 14 15 ... integers congruent to 2 or 3 mod 4
%C 1 4 5 8 9 12 13 16 ... integers congruent to 0 or 1 mod 4
%D M. Cerasoli, F. Eugeni and M. Protasi, Elementi di Matematica Discreta, Bologna 1988
%D Emanuele Munarini and Norma Zagaglia Salvi, Matematica Discreta,UTET, CittaStudiEdizioni, Milano 1997
%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,1,-1).
%F For n>2, a(n+4k) = a(n) + 4k, with k>=1.
%F G.f.: x*(2+x-2*x^2+5*x^3-4*x^4+2*x^5)/(1-x-x^4+x^5). - _Philippe Deléham_, Dec 02 2016
%Y Cf. A090964.
%K easy,nonn
%O 1,1
%A _Giovanni Teofilatto_, Mar 17 2006
%E Terms corrected by _R. J. Mathar_, Oct 25 2011