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 #12 Nov 14 2014 19:50:57
%S 1,1,19,235,3181,44725,648439,9614329,145020445,2217212539,
%T 34269961873,534449721793,8397498847645,132785160326593,
%U 2111135363144743,33723822603109987,540949658114010583,8708952402795685879,140665766088396528829,2278642960112808284773
%N The number of walks from (0,0,0) to (n,n,n) with steps that increment one to three coordinates and having the property that no two consecutive steps are orthogonal.
%C a(n) is also the number of standard sequence alignments of three strings of length n, counting only those alignments with the property that, for every pair of consecutive alignment columns, there is at least one sequence that contributes a non-gap to both columns. That is, a(n) counts only those standard alignments with a column order that can be unambiguously reconstructed from the knowledge of all pairings, where a pairing is, e.g., that some i-th position of some string x is in the same column as some j-th position of some string y. - _Lee A. Newberg_, Dec 11 2009
%H Alois P. Heinz, <a href="/A171158/b171158.txt">Table of n, a(n) for n = 0..150</a>
%F a(n) ~ c * d^n / n, where d = 17.073685937995..., c = 0.171212682922... . - _Vaclav Kotesovec_, Sep 10 2014
%e For n = 2, the 19 walks are:
%e 000 -> 001 -> 012 -> 122 -> 222
%e 000 -> 001 -> 102 -> 212 -> 222
%e 000 -> 001 -> 112 -> 222
%e 000 -> 010 -> 021 -> 122 -> 222
%e 000 -> 010 -> 120 -> 221 -> 222
%e 000 -> 010 -> 121 -> 222
%e 000 -> 011 -> 112 -> 222
%e 000 -> 011 -> 121 -> 222
%e 000 -> 011 -> 122 -> 222
%e 000 -> 100 -> 201 -> 212 -> 222
%e 000 -> 100 -> 210 -> 221 -> 222
%e 000 -> 100 -> 211 -> 222
%e 000 -> 101 -> 112 -> 222
%e 000 -> 101 -> 211 -> 222
%e 000 -> 101 -> 212 -> 222
%e 000 -> 110 -> 121 -> 222
%e 000 -> 110 -> 211 -> 222
%e 000 -> 110 -> 221 -> 222
%e 000 -> 111 -> 222
%Y See A171155 for the number of such walks in two dimensions.
%Y See A171563 for the number of such walks in four dimensions. - _Lee A. Newberg_, Dec 11 2009
%K nonn,walk
%O 0,3
%A _Lee A. Newberg_, Dec 04 2009
%E Extended beyond a(10) by _Alois P. Heinz_, Jan 22 2013