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”).
%I #13 Apr 30 2024 20:43:48
%S 4095,16245775,60131384705,210502738714097,714097521397778495,
%T 2380826437768134741023,7862987107940658832635809,
%U 25834416752721407468468718385,84641600245355780352751022513463,276889755885138056467643815501003447,905061607197623234620822097612564300097
%N Number of n X 12 binary arrays with a path of adjacent 1's from top row to bottom row.
%H Sean A. Irvine, <a href="/A069387/b069387.txt">Table of n, a(n) for n = 1..100</a>
%Y 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.
%K nonn
%O 1,1
%A _R. H. Hardin_, Mar 22 2002
%E More terms from _Sean A. Irvine_, Apr 30 2024