OFFSET
0,1
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
P. Beentjes, An algorithm for the generation of perfect squared rectangles of arbitrary dimension, Nieuw Arch. Wisk. 5/1 (2000) 344.
Index entries for linear recurrences with constant coefficients, signature (0,22,0,9).
FORMULA
a(2n) = 11a(2n-2)+10a(2n-1), a(2n+1) = 13a(2n-2)+11a(2n-1), a(0) = 33, a(1) = 32.
a(n) = 22*a(n-2)+9*a(n-4) for n>3. - Colin Barker, May 28 2015
G.f.: -(77*x^3-43*x^2+32*x+33) / (9*x^4+22*x^2-1). - Colin Barker, May 28 2015
MATHEMATICA
LinearRecurrence[{0, 22, 0, 9}, {33, 32, 683, 781}, 30] (* Harvey P. Dale, Sep 22 2023 *)
PROG
(PARI) Vec(-(77*x^3-43*x^2+32*x+33) / (9*x^4+22*x^2-1) + O(x^100)) \\ Colin Barker, May 28 2015
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Floor van Lamoen, Dec 26 2001
STATUS
approved