|
Search: id:A067010
|
|
|
| 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. |
|
+0
2
|
|
| 32, 33, 682, 779, 15292, 17435, 342562, 390581, 7673992, 8749697, 171910882, 196008563, 3851105332, 4390935659, 86271515242, 98364661565, 1932633283312, 2203540975361, 43294375870042, 49363183412027, 969869968690732
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
REFERENCES
|
P. Beentjes, An algorithm for the generation of perfect squared rectangles of arbitrary dimension, Nieuw Arch. Wisk. 5/1 (2000) 344
|
|
FORMULA
|
a(2n)=11a(2n-2)+10a(2n-1), a(2n+1)=13a(2n-2)+11a(2n-1), a(0)=32, a(1)=33.
|
|
CROSSREFS
|
Cf. A067011.
Sequence in context: A134843 A134844 A022402 this_sequence A029925 A074287 A095481
Adjacent sequences: A067007 A067008 A067009 this_sequence A067011 A067012 A067013
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Floor van Lamoen (fvlamoen(AT)hotmail.com), Dec 26 2001
|
|
|
Search completed in 0.002 seconds
|
