Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059573
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A059573
%S A059573 1,1,1,2,4,1,5,8,4,1,12,34,18,4,1,35,85,61,22,5,1
%N A059573 Polyotessamino numbers T(n,k) (1<=k<=n): take all the polyominoes with 
               n cells (including those with holes but excluding rotations and reflections); 
               fill them as completely as possible with rectangular 1 X k tiles; 
               T(n,k) is number of ways of doing this.
%H A059573 Fabian Rothelius, <a href="http://w1.875.telia.com/~u87509703/mathez/
               polyotessaminoes/polyotessaminonumbers.html">The polyotessamino numbers</
               a>
%e A059573 1; 1,1; 2,4,1; 5,8,4,1; ...
%Y A059573 T(n, 1)=a(n) where a(n) is the n-th term of A000105.
%Y A059573 Sequence in context: A021418 A094640 A070937 this_sequence A080427 A118906 
               A085059
%Y A059573 Adjacent sequences: A059570 A059571 A059572 this_sequence A059574 A059575 
               A059576
%K A059573 more,nonn,tabl
%O A059573 1,4
%A A059573 Fabian Rothelius (fabian.rothelius(AT)telia.com), Jan 22 2001

    
page 1

Search completed in 0.001 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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research