login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A269270
Number of n X 2 0..3 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling three exactly once.
1
4, 108, 1620, 20412, 236196, 2598156, 27634932, 286978140, 2927177028, 29443957164, 292889889684, 2887057484028, 28242953648100, 274521509459532, 2653707924775476, 25530500379736476, 244598664928443012
OFFSET
1,1
LINKS
FORMULA
Empirical: a(n) = 18*a(n-1) - 81*a(n-2).
Conjectures from Colin Barker, Jan 20 2019: (Start)
G.f.: 4*x*(1 + 9*x) / (1 - 9*x)^2.
a(n) = 9^(n-1) * (8*n-4).
(End)
EXAMPLE
Some solutions for n=4:
2 3 2 2 3 3 2 2 3 0 2 2 0 0 1 1 1 3 3 1
2 0 2 2 3 1 0 0 0 0 3 1 2 1 0 2 1 1 1 1
3 1 0 0 0 0 1 2 1 0 0 3 0 1 0 2 2 0 3 0
1 0 3 3 3 2 0 0 1 3 1 0 0 0 1 0 1 1 2 2
CROSSREFS
Column 2 of A269276.
Sequence in context: A220531 A322085 A128865 * A302113 A357510 A336028
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 21 2016
STATUS
approved