A080707 - OEIS

A080707

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 3" is satisfied.

%I #7 Mar 30 2012 17:27:18

%S 5,7,8,10,12,13,15,18,19,21,22,24,27,28,30,31,32,33,36,37,39,42,43,45,

%T 46,47,48,51,52,54,57,60,63,64,65,66,69,70,72,73,74,75,78,79,81,84,87,

%U 90,91,92,93,96,97,99,100,101,102,103,104,105,106,107,108,111,114,117

%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 3" 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))} = {3i : i >= 4}.

%K nonn,easy

%O 1,1

%A Benoit Cloitre, Mar 01 2003

%E More terms from _Matthew Vandermast_, Mar 14 2003