A022316 a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 11.

0, 11, 12, 24, 37, 62, 100, 163, 264, 428, 693, 1122, 1816, 2939, 4756, 7696, 12453, 20150, 32604, 52755, 85360, 138116, 223477, 361594, 585072, 946667, 1531740, 2478408, 4010149, 6488558, 10498708

Offset: 0

Author

N. J. A. Sloane

Keywords

• nonn

Links

• G. C. Greubel, Table of n, a(n) for n = 0..1000
• Index entries for linear recurrences with constant coefficients, signature (2,0,-1).

Programs

Mathematica

LinearRecurrence[{2,0,-1}, {0,11,12}, 50] (* G. C. Greubel, Aug 25 2017 *)

PARI

x='x+O('x^50); concat([0], Vec(x*(11-10*x) / ( (1-x)*(1-x-x^2) ))) \\ G. C. Greubel, Aug 25 2017

Formula

From R. J. Mathar, Apr 07 2011: (Start)

G.f.: x*(11-10*x) / ( (1-x)*(1-x-x^2) ).

a(n) = A022102(n) - 1. (End)

a(n) = F(n+2) + 10*F(n) - 1, where F = A000045. - G. C. Greubel, Aug 25 2017