|
Search: id:A061709
|
|
|
| A061709 |
|
Consider a (hollow) triangle with n cells on each edge, for a total of 3(n-1) cells if n>1, or 1 cell if n=1; a(n) is number of ways of labeling cells with 0's and 1's; triangle may be rotated and turned over. |
|
+0
2
|
|
| 1, 4, 20, 104, 752, 5600, 44224, 350592, 2800384, 22377984, 178990080, 1431721984, 11453509632, 91626496000, 733009854464, 5864066220032, 46912512917504, 375300002545664, 3002399885885440, 24019198281252864, 192153585175232512
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
(1/6)*(2^(3*(n-1))+2^n+3*2^(floor((3*n-1)/2))) for n>1.
|
|
EXAMPLE
|
a(2) = 4, the labelings being {000}, {001}, 011}, {111}. Some of the 20 solutions for n=3 are as follows:
..0......1.......0......1.......1.......1.......0
.0.0....0.0.....1.0....1.0.....0.0.....0.0.....1.1
0.0.0..0.0.0...0.0.0..0.0.0...1.0.0...0.1.0...0.0.0
The first solution for n = 4 is
...0
..0.0
.0...0
0.0.0.0
|
|
CROSSREFS
|
Cf. A061348.
Sequence in context: A089382 A026305 A131786 this_sequence A135159 A020084 A026127
Adjacent sequences: A061706 A061707 A061708 this_sequence A061710 A061711 A061712
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
njas, Jun 20, 2001
|
|
|
Search completed in 0.002 seconds
|
