cp's OEIS Frontend

A214126 a(2n)=a(n-1)+a(n) and a(2n+1)=a(n+1) for n>=1, with a(0)=a(1)=1.

%I A214126 #19 May 21 2021 16:24:11
%S A214126 1,1,2,2,3,2,4,3,5,2,5,4,6,3,7,5,8,2,7,5,7,4,9,6,10,3,9,7,10,5,12,8,
%T A214126 13,2,10,7,9,5,12,7,12,4,11,9,13,6,15,10,16,3,13,9,12,7,16,10,17,5,15,
%U A214126 12,17,8,20,13,21,2,15,10,12,7,17,9,16,5,14,12
%N A214126 a(2n)=a(n-1)+a(n) and a(2n+1)=a(n+1) for n>=1, with a(0)=a(1)=1.
%C A214126 a(2^n) = A000045(n+2), a(2^n-1) = A000045(n+1). - _Alois P. Heinz_, Jul 06 2012
%H A214126 Alois P. Heinz, <a href="/A214126/b214126.txt">Table of n, a(n) for n = 0..8192</a>
%F A214126 a(0) = a(1) = 1, for n>=1:  a(2*n) = a(n-1)+a(n) and a(2*n+1) = a(n+1).
%e A214126 a(2^n+1) = 2 because a(2) = 2 and a(2*n+1) = a(n+1).
%p A214126 a:= proc(n) local r;
%p A214126       a(n):= `if`(n<2, 1, `if`(irem(n, 2, 'r')=0, a(r-1)+a(r), a(r+1)))
%p A214126     end:
%p A214126 seq(a(n), n=1..100);  # _Alois P. Heinz_, Jul 06 2012
%t A214126 a[0] = a[1] = 1;
%t A214126 a[n_] := a[n] = If[EvenQ[n], a[n/2-1] + a[n/2], a[(n-1)/2+1]];
%t A214126 Array[a, 100, 0] (* _Jean-François Alcover_, May 31 2019 *)
%o A214126 (Python)
%o A214126 a = [1]*(77*2)
%o A214126 for n in range(1,77):
%o A214126     a[2*n  ]=a[n-1]+a[n]
%o A214126     a[2*n+1]=a[n+1]
%o A214126     print(str(a[n-1]),end=',')
%Y A214126 Cf. A120562: same formula, seed {0,1}, first term removed.
%Y A214126 Cf. A082498: same formula, seed {1,0}, first term removed.
%Y A214126 Cf. A214127: same formula, seed {1,2}.
%Y A214126 Cf. A000045.
%K A214126 nonn,easy
%O A214126 0,3
%A A214126 _Alex Ratushnyak_, Jul 04 2012