|
Search: id:A132390
|
|
|
| A132390 |
|
Number of binary pattern classes in the (2,n)-rectangular grid; two patterns are in same class if one of them can be obtained by reflexion or rotation of the other one. |
|
+0
2
|
|
| 3, 6, 24, 76, 288, 1072, 4224, 16576, 66048, 262912, 1050624, 4197376, 16785408, 67121152, 268468224, 1073790976, 4295098368, 17180065792, 68720001024, 274878693376, 1099513724928, 4398049656832, 17592194433024, 70368756760576
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
A005418 is the solution for the problem in the (1,n)-rectangular grid
For n<>2, a(n)=4^(n-1)+2*A133572(n-1). [From Jon E. Schoenfield (jonscho(AT)hiwaay.net), Aug 25 2009]
|
|
FORMULA
|
For n<>2, a(n)=4^(n-1)+2^(n-2)*(3+(n mod 2)). [From Jon E. Schoenfield (jonscho(AT)hiwaay.net), Aug 25 2009]
|
|
CROSSREFS
|
Cf. A005418, A034851.
Sequence in context: A148655 A148656 A054718 this_sequence A152761 A109155 A081072
Adjacent sequences: A132387 A132388 A132389 this_sequence A132391 A132392 A132393
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Yosu Yurramendi (yosu.yurramendi(AT)ehu.es), Aug 26 2008
|
|
EXTENSIONS
|
More terms from Jon E. Schoenfield (jonscho(AT)hiwaay.net), Aug 25 2009, corrected Aug 30 2009
|
|
|
Search completed in 0.002 seconds
|
