login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069378 Number of n X 3 binary arrays with a path of adjacent 1's from top row to bottom row. 0
7, 37, 197, 1041, 5503, 29089, 153769, 812849, 4296863, 22713981, 120070149, 634712209, 3355201895, 17736195433, 93756691401, 495614587553, 2619907077991, 13849295944501, 73209847696773 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..19.

FORMULA

G.f.: x*(7-12*x+x^2+2*x^3-2*x^4)/(1-7*x+9*x^2+x^3-4*x^4+2*x^5). - Vladeta Jovovic, Jul 02 2003

CROSSREFS

Cf. 1 X n A000225, 2 X n A005061, n X 2 A001333, vertical path of 1 A069361-A069395, vertical paths of 0+1 A069396-A069416, vertical path of 1 not 0 A069417-A069428, no vertical paths A069429-A069447, no horizontal or vertical paths A069448-A069452.

Sequence in context: A106925 A085640 A196805 * A287808 A117130 A002807

Adjacent sequences:  A069375 A069376 A069377 * A069379 A069380 A069381

KEYWORD

nonn

AUTHOR

R. H. Hardin, Mar 22 2002.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 18 01:16 EST 2017. Contains 294837 sequences.