This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A078526 #6 May 27 2024 11:36:13 %S A078526 1,5,31,173,1521,4224,33418,184183,1370009,3798472,26957026,150399317, %T A078526 1034714947,2897704261,19494273755,109619578524,724456628891 %N A078526 Probability P(n) of the occurrence of a 2D self-trapping walk of length n. %C A078526 This is a cleaner representation than the one given by A077483 and A077484, using the upper bound for the denominator A077484 given in A076874. %D A078526 See under A077483 %H A078526 Hugo Pfoertner, <a href="http://www.randomwalk.de/stw2d.html">Results for the 2D Self-Trapping Random Walk</a> %F A078526 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) ) %e A078526 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. %o A078526 (Fortran) c Program provided at given link %Y A078526 Cf. A077483, A077484, A076874, A001411. %K A078526 more,nonn %O A078526 7,2 %A A078526 _Hugo Pfoertner_, Nov 27 2002