|
%I #26 Mar 13 2015 15:43:38
%S 2,4,8,11,13,16,18,22,26,28,31,35,38,40,44,48,51,53,56,58,62,65,67,70,
%T 74,78,80,83,85,89,92,94,97,99,103,107,110,112,115,119,121,124,126,
%U 130,133,135,138,140,144,148,150,153,157,160,162,165,167,171,175,178,180
%N Numbers n such that A000002(n)=A000002(n+1) where A000002 is the Kolakoski sequence.
%C Complement sequence of A054353. - _Benoit Cloitre_, Feb 07 2009
%C This sequence is the union of A074262 and A074263. - _Nathaniel Johnston_, May 02 2011
%C A054354(a(n)-1) = 0. - _Reinhard Zumkeller_, Aug 03 2013
%C This is a subsequence of A216345. In particular, this consists of A216345(i) such that A000002(i) = A216345(i+1)-A216345(i) = 2. A013948 is the sequence of all such i. - _Danny Rorabaugh_, Mar 13 2015
%H Nathaniel Johnston, <a href="/A078649/b078649.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) is probably asymptotic to 3*n.
%F a(n) = A216345(A013948(n)). - _Danny Rorabaugh_, Mar 13 2015
%p isA078649 := proc(n)
%p if A000002(n) = A000002(n+1) then
%p true;
%p else
%p false;
%p end if;
%p end proc:
%p A078649 := proc(n)
%p option remember;
%p if n = 1 then
%p 2;
%p else
%p for a from procname(n-1)+1 do
%p if isA078649(a) then
%p return a;
%p end if;
%p end do:
%p end if;
%p end proc:
%p seq(A078649(n),n=1..50) ; # _R. J. Mathar_, Nov 15 2014
%t a2 = {1, 2, 2}; Do[ a2 = Join[a2, {1+Mod[n-1, 2]}], {n, 3, 80}, {a2[[n]]}]; a3 = Accumulate[a2]; Complement[ Range[ Last[a3]], a3] (* _Jean-François Alcover_, Jun 18 2013 *)
%o (Haskell)
%o a078649 n = a078649_list !! (n-1)
%o a078649_list = map (+ 1) $ filter ((== 0) . a054354) [1..]
%o -- _Reinhard Zumkeller_, Aug 03 2013
%Y Cf. A054353, A074262, A074263, A013948, A216345.
%K nonn,easy
%O 1,1
%A _Benoit Cloitre_, Dec 14 2002
|
