|
%I #7 Mar 30 2012 17:27:18
%S 1,2,4,5,7,8,10,11,12,13,14,17,19,22,24,27,29,30,31,32,33,34,36,37,39,
%T 40,41,42,43,46,47,49,50,53,54,55,58,60,61,62,65,66,67,68,69,70,71,72,
%U 73,74,75,76,77,79,82,84,87,89,90,91,94,95,96,99,101,103,106,107,109
%N 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 not a multiple of either 3 or 4.".
%C A generalization of A079000 that, like A079000 itself, is based on a class of numbers comprising exactly one-half of the integers.
%H 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 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)
%e a(3) cannot be 3 because that would imply that the third term is not a multiple of 3. 4 is the smallest possible value for a(3) that creates no contradiction; therefore a(3)=4 and the fourth term is the next member of the sequence that is not a multiple of 3 or 4.
%Y Cf. A079000.
%K easy,nonn
%O 1,2
%A _Matthew Vandermast_, Feb 14 2003
|
