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.

User: Krishnan Balasubramanian

Krishnan Balasubramanian's wiki page.

Krishnan Balasubramanian has authored 1 sequences.

A360786 Number of ways to place two dimers on an n-cube.

Original entry on oeis.org

0, 2, 42, 400, 2840, 17376, 97440, 516608, 2634624, 13058560, 63320576, 301707264, 1417009152, 6575120384, 30195425280, 137430827008, 620604391424, 2783097520128, 12403773407232, 54975376916480, 242441862512640, 1064326263734272, 4653131038195712, 20266193591992320
Offset: 1

Author

Keywords

Comments

Equivalently, a(n) is the number of 2-matchings in the n-hypercube graph. A 2-matching is a pair of edges that do not share a vertex.

Examples

			The a(2) = 2 2-matchings are:
    o---o     o   o
              |   |
    o---o     o   o
		

Crossrefs

Column k=2 of A302235.
Third from last terms in rows of A192437.
Cf. A001787 (1-matchings), A045310 (matchings).

Programs

  • PARI
    a(n) = 2^(n-2)*n*(1 - 2*n + n*2^(n-1)) \\ Andrew Howroyd, Feb 20 2023

Formula

a(n) = A192437(n, 2^(n-1)-2) for n > 1.
From Andrew Howroyd, Feb 20 2023: (Start)
a(n) = 2^(n-2)*n*(1 - 2*n + n*2^(n-1)).
a(n) = 18*a(n-1) - 132*a(n-2) + 504*a(n-3) - 1056*a(n-4) + 1152*a(n-5) - 512*a(n-6) for n > 6.
G.f.: 2*x^2*(1 + 3*x - 46*x^2 + 88*x^3)/((1 - 2*x)*(1 - 4*x))^3.
(End)

Extensions

Terms a(13) and beyond from Andrew Howroyd, Feb 20 2023