Search: id:A079313
Results 1-1 of 1 results found.

%I A079313
%S A079313 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,28,
%T A079313 39,41,43,32,45,47,49,36,51,53,55,40,57,59,61,44,63,65,67,48,69,71,73,
%U A079313 52,75,77,79,56,81,83,85,60,87,89,91,64,93,95,97,68,99,101,103,72,105
%N A079313 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".
%H A079313 B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://www.cs.uwaterloo.ca/
               journals/JIS/index.html">Numerical analogues of Aronson's sequence</
               a>, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
%H A079313 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> 
               (math.NT/0305308)
%F A079313 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 A079313 All odd numbers occur; the only even numbers which occur are 2 and the 
               multiples of 4 excluding 4 itself.
%Y A079313 Equals A080032 + 1. Cf. A079000, A079250-A079259, A080029-A080031.
%Y A079313 Sequence in context: A073897 A097465 A120683 this_sequence A125132 A026184 
               A026208
%Y A079313 Adjacent sequences: A079310 A079311 A079312 this_sequence A079314 A079315 
               A079316
%K A079313 easy,nonn
%O A079313 1,2
%A A079313 J. C. Lagarias and N. J. A. Sloane (njas(AT)research.att.com), Feb 11 
               2003
%E A079313 More terms from Matthew Vandermast (ghodges14(AT)comcast.net), Mar 20 
               2003

Search completed in 0.001 seconds