cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 11-12 of 12 results.

A353934 Number of tilings of an n X n square using right trominoes, dominoes, and monominoes.

Original entry on oeis.org

1, 1, 11, 369, 83374, 90916452, 546063639624, 17259079054003609, 2916019543694306398589, 2620143594924539083433405392, 12541344781693990981151732534871036, 319608708168951734031266758322647453517098, 43373075269161087186367095378869660507262626652634
Offset: 0

Views

Author

Alois P. Heinz, May 11 2022

Keywords

Examples

			a(2) = 11:
  .___. .___. .___. .___. .___. .___. .___. .___. .___. .___. .___.
  |_|_| |___| | | | |_|_| |___| |_| | | |_| |_| | |_. | | ._| | |_|
  |_|_| |___| |_|_| |___| |_|_| |_|_| |_|_| |___| |_|_| |_|_| |___| .
		

Crossrefs

Formula

a(n) = A353877(n,n).

A330658 Number of ways to place zero or more dominoes on an n X n grid with an equal number of horizontal and vertical dominoes.

Original entry on oeis.org

1, 1, 1, 23, 1608, 371500, 328956227, 1126022690953, 14806761014366079, 744494518032208898560, 142687918961909575461700797, 103997384424546478979311463191760, 287748628673335369235353717267441839979, 3018422667417995172483450578913829739500058615
Offset: 0

Views

Author

Andrew Howroyd, Mar 01 2020

Keywords

Examples

			a(1) = a(2) = 1 because the only possibility is placing no dominoes at all.
a(3) = 23 because there is 1 way to place no dominoes, 20 ways to place one horizontal domino and one vertical domino, and 2 ways to place two horizontal and two vertical dominoes.
		

Crossrefs

Previous Showing 11-12 of 12 results.