A067010 a(2n) and a(2n+1) are side lengths of a Beentjes sequence of perfect squared rectangles, starting with a 32 X 33 rectangle.

32, 33, 682, 779, 15292, 17435, 342562, 390581, 7673992, 8749697, 171910882, 196008563, 3851105332, 4390935659, 86271515242, 98364661565, 1932633283312, 2203540975361, 43294375870042, 49363183412027, 969869968690732, 1105821903842843, 21726788694026482

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) = 11*a(2n-2)+10*a(2n-1), a(2n+1) = 13*a(2n-2)+11*a(2n-1), a(0) = 32, a(1) = 33.

a(n) = 22*a(n-2)+9*a(n-4) for n>3. - Colin Barker, May 26 2015

G.f.: -(53*x^3-22*x^2+33*x+32) / (9*x^4+22*x^2-1). - Colin Barker, May 26 2015

Prog

(PARI) Vec(-(53*x^3-22*x^2+33*x+32) / (9*x^4+22*x^2-1) + O(x^100)) \\ Colin Barker, May 26 2015

Crossrefs

Cf. A067011.

Sequence in context: A022402 A194768 A217845 * A332923 A029925 A074287

Adjacent sequences: A067007 A067008 A067009 * A067011 A067012 A067013

Keyword

nonn,easy

Author

Floor van Lamoen, Dec 26 2001

Status

approved