login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A108550 Number of ways of packing a 3 X (2n-1) rectangle with dominoes, leaving one space unoccupied. 0

%I #2 Sep 21 2005 03:00:00

%S 2,18,160,1530,14800,143386,1389432,13464130,130472968,1264337250,

%T 12251953552,118726523722,1150509376512,11148914193898,

%U 108037613809384,1046929395512082,10145181113692600,98311022950389682

%N Number of ways of packing a 3 X (2n-1) rectangle with dominoes, leaving one space unoccupied.

%F G.f.: ( (2x)(1+x-x^2)(1-4x+x^2))/((1-10x+3x^2)(1-x)^2))

%Y Cf. A001835.

%K easy,nonn

%O 1,1

%A Frans Clauwens (F.Clauwens(AT)science.ru.nl), Jun 09 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 12:33 EDT 2024. Contains 371969 sequences. (Running on oeis4.)