cp's OEIS Frontend

A080591 a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is congruent to 3 mod 4".

%I A080591 #8 Mar 30 2012 16:49:39
%S A080591 1,3,4,7,11,12,13,15,16,17,18,19,23,27,28,31,35,39,43,47,48,49,50,51,
%T A080591 52,53,54,55,59,60,61,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,
%U A080591 79,83,87,91,95,99,103,107,111,112,113,114,115,119,123,124
%N A080591 a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is congruent to 3 mod 4".
%C A080591 The sequence of odd numbers shares many of the properties of this sequence.
%H A080591 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 A080591 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)
%H A080591 <a href="/index/Aa#aan">Index entries for sequences of the a(a(n)) = 2n family</a>
%F A080591 a(a(n)) = 4n+3. a(2^k-1) = 2^(k+1)-1.
%Y A080591 a(n) = A080588(n+1) - 1. Cf. A079000.
%K A080591 easy,nonn
%O A080591 0,2
%A A080591 _N. J. A. Sloane_, Feb 23 2003