|
%I #10 Nov 16 2019 03:24:17
%S 1,3,4,7,11,25,47,87,138,322,641,1275,2514,4937,9371,16869,26881,
%T 63132,126261,252515,504994,1009897,2019291,4036709,8066561,16115612,
%U 32131844,63884955,126255613,246463956,468862629,843601489,1344595962
%N a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 4.
%p s := proc(n) option remember; `if`(n < 1, 0, a(n) + s(n - 1)) end proc:
%p a := proc(n) option remember;
%p `if`(n < 4, [1, 3, 4][n], s(n - 1) - a(-2^ceil(log[2](n - 1)) + 2*n - 3)):
%p end proc:
%p seq(a(n), n = 1..40); # _Petros Hadjicostas_, Nov 15 2019
%K nonn
%O 1,2
%A _Clark Kimberling_
%E Name edited by _Petros Hadjicostas_, Nov 15 2019
|
