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 #9 Jan 30 2016 03:08:56
%S 1,1,1,2,1,1,1,4,3,2,2,1,1,1,1,8,7,6,5,5,4,3,3,2,2,2,1,1,1,1,1,16,15,
%T 14,13,12,12,11,10,9,9,8,7,7,6,6,6,5,4,4,3,3,3,2,2,2,2,1,1,1,1,1,1,32,
%U 31,30,29,28,27,27,26,25,24,23,23,22,21,20,20,19,18,18,17,17,17,16,15,14,14,13,12,12,11,11,11,10
%N a(n) = 1 + A053644(n) - A004001(n+1) = 1 + A072376(n) - A266348(n).
%C Used in a recursive formula of A265754.
%H Antti Karttunen, <a href="/A266349/b266349.txt">Table of n, a(n) for n = 1..8191</a>
%F a(n) = 1 + A053644(n) - A004001(n+1).
%F a(n) = 1 + A072376(n) - A266348(n).
%t b[1] = 1; b[2] = 1; b[n_] := b[n] = b[b[n - 1]] + b[n - b[n - 1]]; Table[1 + 2^(Ceiling@ Log2[n + 1] - 1) - b[n + 1], {n, 96}] (* _Michael De Vlieger_, Jan 26 2016, after _Robert G. Wilson v_ at A004001 *)
%o (Scheme, two variants)
%o (define (A266349 n) (+ 1 (- (A053644 n) (A004001 (+ 1 n)))))
%o (define (A266349 n) (+ 1 (- (A072376 n) (A266348 n))))
%Y Cf. A004001, A053644, A072376, A266348, A265754, A266640.
%K nonn
%O 1,4
%A _Antti Karttunen_, Jan 22 2016