%I #18 Apr 13 2024 01:45:44
%S 1,3,5,2,7,8,9,11,13,12,15,17,19,16,21,23,25,20,27,29,31,24,33,35,37,
%T 28,39,41,43,32,45,47,49,36,51,53,55,40,57,59,61,44,63,65,67,48,69,71,
%U 73,52,75,77,79,56,81,83,85,60,87,89,91,64,93,95,97,68,99,101,103,72,105
%N a(n) is taken to be the smallest positive integer not already present which is consistent with the condition "n is a member of the sequence if and only if a(n) is odd".
%C The sequence obeys the rule: "The concatenation of a(n) and a(a(n)) is odd". Example: "1" and the 1st term, concatenated, is 11; "3" and the 3rd term, concatenated, is 35; "5" and the 5th term, concatenated, is 57; "2" and the 2nd term, concatenated, is 23; etc.
%H B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL6/Cloitre/cloitre2.html">Numerical analogues of Aronson's sequence</a>, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
%H B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://arXiv.org/abs/math.NT/0305308">Numerical analogues of Aronson's sequence</a>, arXiv:math/0305308 [math.NT], 2003.
%H <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,2,0,0,0,-1).
%F For n >= 5 a(n) is given by: a(4t-2) = 4t, a(4t-1) = 6t-3, a(4t) = 6t-1, a(4t+1) = 6t+1.
%F All odd numbers occur; the only even numbers which occur are 2 and the multiples of 4 excluding 4 itself.
%F From _Chai Wah Wu_, Apr 13 2024: (Start)
%F a(n) = 2*a(n-4) - a(n-8) for n > 12.
%F G.f.: x*(-3*x^11 + 2*x^10 - x^9 + 7*x^7 - x^6 + 2*x^5 + 5*x^4 + 2*x^3 + 5*x^2 + 3*x + 1)/(x^8 - 2*x^4 + 1). (End)
%Y Equals A080032 + 1. Cf. A079000, A079250-A079259, A080029-A080031.
%K easy,nonn
%O 1,2
%A J. C. Lagarias and _N. J. A. Sloane_, Feb 11 2003
%E More terms from _Matthew Vandermast_, Mar 20 2003