login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096267 Number of fixed polyedges with n edges (number of ways of embedding connected undirected graphs with n edges into the plane square lattice, inequivalent up to translation). 2
2, 6, 22, 88, 372, 1628, 7312, 33466, 155446, 730534, 3466170, 16576874, 79810756, 386458826, 1880580352, 9190830700, 45088727820, 221945045488, 1095798917674, 5424898610958, 26922433371778 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Found using the rooted method (also known as Redelmeier's algorithm).

REFERENCES

Alexander Malkis, "Polyedges, polyominoes and the 'Digit' game", diploma thesis in computer science, Universitaet des Saarlandes, Germany

LINKS

Table of n, a(n) for n=1..21.

Alexander Malkis, Polyedges, polyominoes and the 'Digit' game

EXAMPLE

_|_|_ is a polyedge with 5 edges

CROSSREFS

Cf. A019988 for "free" polyedges.

Sequence in context: A199481 A049137 A287223 * A150264 A294593 A214358

Adjacent sequences:  A096264 A096265 A096266 * A096268 A096269 A096270

KEYWORD

nonn

AUTHOR

Alexander Malkis, Jun 22 2004

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 16 11:12 EDT 2019. Contains 324152 sequences. (Running on oeis4.)