OFFSET
0,5
COMMENTS
If someone extends this, the analogs L(m, n) = numbers of binary partitions of n in which exactly m of the powers of 2 are used an odd number of times for m>2 could also be added (A307149 is the case m=2).
LINKS
Vaclav Kotesovec, Table of n, a(n) for n = 0..10000
George E. Andrews and Jim Lawrence, Binary partitions and binary partition polytopes, preprint.
George E. Andrews and Jim Lawrence, Binary partitions and binary partition polytopes, Aequationes mathematicae 91.5 (2017): 859-869.
MATHEMATICA
Clear[L]; L[m_, n_] := L[m, n] = If[n == 0, If[m == 0, 1, 0], If[EvenQ[n] && n >= 2, L[m, n - 2] + L[m, n/2], If[m >= 1, L[m - 1, n - 1], 0]]]; Table[L[1, n], {n, 0, 100}] (* Vaclav Kotesovec, Mar 29 2019 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Mar 28 2019
EXTENSIONS
More terms from Vaclav Kotesovec, Mar 29 2019
STATUS
approved