%I
%S 1,2,3,2,3,4,3,4,5,6,5,6,5,6,7,6,7,8,7,8,9,8,9,8,9,10,9,10,9,10,11,10,
%T 11,10,11,10,11,12,11,12,13,12,13,12,13,12,13,12,13,14,15,14,15,14,15,
%U 14,15,14,15,14,15,16,15,16,17,16,17,16,17
%N Variation of Golomb's sequence: a(n) is the number of times n appears with a(n) unequal to a(n1).
%C a(n) is understood to be the smallest number >=a(n2) fitting the description.
%H Rémy Sigrist, <a href="/A111439/b111439.txt">Table of n, a(n) for n = 1..10000</a>
%o (PARI) r = vector(69,k,1); p = 0; for (i=1, #r, v = 1; while (v==p  r[v]==0, v++); r[i]=v; r[v]; print1 (v ", "); p=v); \\ _Rémy Sigrist_, Jan 28 2017
%Y Bisections: A080606 and A080605. Cf. A001462 (Golomb's sequence).
%K nonn
%O 1,2
%A _Floor van Lamoen_, Nov 14 2005
%E Offset corrected by _Rémy Sigrist_, Jan 28 2017
