login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A167402 Number of n-step walks on square lattice, self-avoiding until the last step. 0

%I #2 May 10 2013 12:45:52

%S 0,0,4,12,44,116,356,948,2772,7396,20972,56108,156236,418228,1151556,

%T 3081180,8421052,22514652,61207972,163518308,442769316,1181982628,

%U 3190663628,8511628124,22920057932,61104234356,164212633412

%N Number of n-step walks on square lattice, self-avoiding until the last step.

%C A001411(n)=4^n-(a(n)+4*(a(n-1)+4*(a(n-2)+...)))

%F a(n) = 4*A001411(n-1)-A001411(n), n>0. [From _Vladeta Jovovic_, Nov 02 2009]

%Y See references given for A001411.

%K nonn

%O 0,3

%A Vadim Sheikhman (vvsshh(AT)gmail.com), Nov 02 2009

%E More terms from _Vladeta Jovovic_, Nov 02 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 25 17:34 EDT 2024. Contains 375442 sequences. (Running on oeis4.)