Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121196
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121196 Consider the tiling of the plane with squares of two different sizes as in Fig. 2.4.2(g) of Gruenbaum and Shephard, p. 74. a(n) is the number of connected figures that can be formed on this tiling, from n tiles, each composed of a big square and an adjacent little square. +0
4
1, 11, 114, 1519, 20769 (list; graph; listen)
OFFSET

1,2

COMMENT

The Zucca web site calls these figures "n-PairSquares".

REFERENCES

Branko Gruenbaum and G. C. Shephard, Tilings and Patterns. W. H. Freeman, New York, 1987.

LINKS

Livio Zucca, PolyMultiForms

CROSSREFS

Cf. A121195, A121197, A121198.

Sequence in context: A048553 A110799 A088089 this_sequence A125446 A076554 A044724

Adjacent sequences: A121193 A121194 A121195 this_sequence A121197 A121198 A121199

KEYWORD

nonn

AUTHOR

njas, Aug 17 2006

EXTENSIONS

Better definition from Don Reble, Aug 17 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 7 15:23 EDT 2008. Contains 143483 sequences.


AT&T Labs Research