|
%I #19 Feb 11 2021 03:57:17
%S 2,4,8,11,13,16,19,22,26,29,32,35,38,41,44,47,49,52,55,58,61,64,67,70,
%T 73,76,79,82,85,88,91,94,98,101,104,107,110,113,116,119,122,125,128,
%U 131,134,137
%N a(n) = c(n) + c(n-1) where c is the sequence of numbers not in a.
%H Ivan Neretin, <a href="/A022442/b022442.txt">Table of n, a(n) for n = 0..10000</a>
%H R. Stephan, <a href="/somedcgf.html">Some divide-and-conquer sequences ...</a>
%H R. Stephan, <a href="/A079944/a079944.ps">Table of generating functions</a>
%F For n>0, a(n)=b(n) with b(0)=0, b(2n) = -b(n)+9n+3, b(2n+1) = -b(n)+9n+6-2[n==0]. - _Ralf Stephan_, Oct 23 2003
%t Fold[Append[#1, Plus @@ Complement[Range[Max@#1 + 3], #1][[{#2 + 1, #2 + 2}]]] &, {2, 4}, Range[44]] (* _Ivan Neretin_, Mar 30 2017 *)
%Y Cf. A099467 (complement).
%Y Cf. A022424 and references therein.
%K nonn,easy
%O 0,1
%A _Clark Kimberling_
|
