Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049222
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049222 Number of horizontally convex n-ominoes in which the top row has exactly 1 square, which is not above the rightmost square in the second row and the rightmost square in the second row is above the leftmost square in the third row. +0
3
0, 0, 0, 1, 4, 13, 41, 130, 415, 1329, 4260, 13657, 43781, 140346, 449891, 1442157, 4622932, 14819125, 47503729, 152276498, 488132887, 1564743865, 5015895108, 16078800033, 51541709869, 165220529546, 529625878779, 1697752526549 (list; graph; listen)
OFFSET

1,5

REFERENCES

Dean Hickerson, Counting Horizontally Convex Polyominoes, J. Integer Sequences, Vol. 2 (1999), #99.1.8.

LINKS

Hickerson reference.

FORMULA

G.f.: x^4 (1-x)/(1-5x+7x^2-4x^3)

a(n) = 5a(n-1) - 7a(n-2) + 4a(n-3) for n >= 6

MATHEMATICA

a[ n_ ] := a[ n ]=If[ n<6, {0, 0, 0, 1, 4}[ [ n ] ], 5a[ n-1 ]-7a[ n-2 ]+4a[ n-3 ] ]

CROSSREFS

a(n) = a(n-1) + A049220(n-1) for n >= 2

Sequence in context: A077284 A070428 A052529 this_sequence A001453 A141364 A005002

Adjacent sequences: A049219 A049220 A049221 this_sequence A049223 A049224 A049225

KEYWORD

nonn,easy

AUTHOR

Dean Hickerson (dean.hickerson(AT)yahoo.com), Aug 10 1999

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 December 6 13:45 EST 2009. Contains 170429 sequences.


AT&T Labs Research