|
%I #11 Feb 17 2015 03:44:43
%S 5,6,7,9,12,16,20,21,24,25,26,28,29,30,31,32,33,34,35,36,40,41,42,44,
%T 48,52,53,56,60,64,68,72,76,80,84,88,89,90,91,92,96,100,101,104,105,
%U 106,107,108,109,110,111,112,116,117,118,120,121,122,123,124,125,126,127
%N a(1)=5; for n>1, a(n) = smallest number > a(n-1) such that the condition "n is in the sequence if and only if a(n) is a multiple of 4" is satisfied.
%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> (math.NT/0305308)
%F {a(a(n))} = { 4i : i >= 3 }.
%K nonn,easy
%O 1,1
%A _Benoit Cloitre_, Mar 01 2003
%E More terms from _Matthew Vandermast_, Mar 14 2003
|
