7,2

This is a cleaner representation than the one given by A077483 and A077484, using the upper bound for the denominator A077484 given in A076874.

See under A077483

Hugo Pfoertner, Results for the 2D Self-Trapping Random Walk

P(n) = a(n) / ( 3^(n-1) * 2^(n-floor((4*n+1)^(1/2))-3) ) = a(n) / ( 3^(n-1) * 2^(A076874(n)-3) )

See under A077483; the inclusion of a(7)=1 is somewhat artificial due to the occurrence of 2^(-1) in the denominator: P(7)=a(7)/(3^6 *2^(7-floor(sqrt(29))-3))= 1/(729*2^(7-5-3))=1/(729*2*(-1))=2/729 See also: "Count self-trapping walks up to length 23" provided at given link.

FORTRAN program provided at given link

Cf. A077483, A077484, A076874, A001411.

Sequence in context: A092496 A045904 A034353 this_sequence A137626 A057426 A015540

Adjacent sequences: A078523 A078524 A078525 this_sequence A078527 A078528 A078529

more,nonn

Hugo Pfoertner (hugo(AT)pfoertner.org), Nov 27 2002