A111414 f(f(n+1))-f(f(n)), where f(m) = binary partition(m) = A000123(m).

2, 6, 10, 40, 80, 250, 510, 1890, 4270, 13738, 30630, 101960, 234864, 705046, 1580578, 5136840, 11991928, 36095322, 82990606, 255579576, 595920680, 1719038038, 3926998938, 11665004238, 26978093154, 75938910058, 172678519950, 489262646480, 1114189211016

Offset: 0

Author

N. J. A. Sloane, Nov 12 2005

Keywords

• nonn

Links

• Alois P. Heinz, Table of n, a(n) for n = 0..2500

Crossrefs

Cf. A000123.

Programs

Maple

b:= proc(n, j) option remember; local nn, r; if n<0 then 0 elif j=0 then 1 elif j=1 then n+1 elif n f(f(n+1)) -f(f(n)): seq (a(n), n=0..50);  # Alois P. Heinz, Sep 28 2011

Mathematica

b[n_, j_] := b[n, j] = Module[{nn, r}, Which[n<0, 0, j == 0, 1, j == 1, n+1, nJean-François Alcover, Mar 19 2014, after Alois P. Heinz *)