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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A354308 Number of free polyjogs with n cells. 0
 1, 1, 4, 17, 88, 503, 3071, 19372, 124575, 813020, 5361539, 35662727, 238864272, 1609398564 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS A polyjog is a polyform composed of n connected unit squares adjoined along half-edges: every pair of adjacent cells shares an edge of length exactly 1/2. The polyjogs of order n form a subset of polyominoes of order 4n. Figures that differ by a rotation or reflection are considered equivalent. It is not hard to prove that every polyjog can be tiled by unit squares in exactly one way. Therefore, equivalences involving internal rearrangement of unit squares are not relevant (unlike related sequences; cf. A216583). LINKS Table of n, a(n) for n=1..14. George Sicherman, Catalogue of Polyjogs EXAMPLE a(3) = 4, because there are four ways to adjoin three unit squares by half-edges: aa cc cc aa aa aabbcc aa cc aabb aa bb aabb bbcc bb bb cc bbcc cc (In these figures, the three unit squares are depicted by 2 X 2 arrangements of letters a, b, and c.) CROSSREFS Cf. A000105, A216583. Sequence in context: A114190 A135168 A364212 * A357617 A350474 A058279 Adjacent sequences: A354305 A354306 A354307 * A354309 A354310 A354311 KEYWORD nonn,hard,more AUTHOR Aaron N. Siegel, May 23 2022 STATUS approved

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.

Last modified April 15 13:47 EDT 2024. Contains 371689 sequences. (Running on oeis4.)