Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069396
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069396 Half the number of 3 X n binary arrays with a path of adjacent 1's and a path of adjacent 0's from top row to bottom row. +0
92
1, 25, 377, 4541, 48329, 476389, 4461489, 40306317, 354713977, 3060942133, 26020259201, 218626028573, 1820140085705, 15043088032837, 123602247055953, 1010793162739629, 8234370308667673, 66870924588036181 (list; graph; listen)
OFFSET

2,2

FORMULA

G.f.: x^2*(2*x+1)^2/(1-8*x)/(2*x^2-7*x+1)/(4*x^2-6*x+1). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Jul 02 2003

CROSSREFS

Cf. 1 X n A000225, 2 X n A016269, 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.

Adjacent sequences: A069393 A069394 A069395 this_sequence A069397 A069398 A069399

Sequence in context: A022749 A036071 A094190 this_sequence A125482 A028130 A028116

KEYWORD

nonn

AUTHOR

Ron Hardin (rhh(AT)cadence.com), Mar 22 2002.

page 1

Search completed in 0.002 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 October 11 09:12 EDT 2008. Contains 144832 sequences.


AT&T Labs Research