DCG for a predicate outputting a list containing a binary number and the decimal counterpart as the last element

Question

Write a DCG for a predicate s that outputs lists of the form

[b₁, b₂, ... , bₙ, k]

for every integer n ≥ 0 such that each bᵢ is either 0 or 1