Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Sep 12 2016 17:02:47
%S 0,1,2,4,5,6,8,10,13,14,15,17,19,21,23,26,28,31,34,36,40,41,42,44,46,
%T 48,50,53,55,58,61,63,67,70,72,76,80,82,85,88,90,94,97,99,102,106,108,
%U 112,116,121,122,123,125,127,129,131,134,136,139,142,144,148,151,153,157,161,163,166,169,171,175,178,180,183,187,189,193,197
%N The infinite trunk of ternary beanstalk, terms divided by 2: a(n) = A276623(n) / 2.
%H Antti Karttunen, <a href="/A276603/b276603.txt">Table of n, a(n) for n = 0..6250</a>
%F a(n) = A276623(n) / 2.
%o (Scheme) (define (A276603 n) (/ (A276623 n) 2))
%Y Cf. A276623, A276605 (first differences).
%K nonn,base
%O 0,3
%A _Antti Karttunen_, Sep 11 2016