with(combinat, fibonacci); p := proc(n) option remember; if n=0 then return 1; fi; expand(1/2*u*p(n-1) + 1/2*subs(u=u^(1/2), p(n-1))); end; seq([nops(p(n)), fibonacci(n+3)-1], n=1..14);