OFFSET
1,3
COMMENTS
The sequence consists of Eulerian numbers from A000295.
The total number of fires for 2n and 2n-1 chips is the same, this is why the interesting increase is 2.
LINKS
Wikipedia, Chip-firing game.
MAPLE
b:= n-> (l-> add(((i-2)*2^(i-1)+1)*(l[i]+1), i=2..nops(l)-1))(Bits[Split](2*n+1)):
a:= n-> b(n+1)-b(n):
seq(a(n), n=1..88); # Alois P. Heinz, Sep 12 2024
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved