login

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”).

A167402
Number of n-step walks on square lattice, self-avoiding until the last step.
0
0, 0, 4, 12, 44, 116, 356, 948, 2772, 7396, 20972, 56108, 156236, 418228, 1151556, 3081180, 8421052, 22514652, 61207972, 163518308, 442769316, 1181982628, 3190663628, 8511628124, 22920057932, 61104234356, 164212633412
OFFSET
0,3
COMMENTS
A001411(n)=4^n-(a(n)+4*(a(n-1)+4*(a(n-2)+...)))
FORMULA
a(n) = 4*A001411(n-1)-A001411(n), n>0. [From Vladeta Jovovic, Nov 02 2009]
CROSSREFS
See references given for A001411.
Sequence in context: A149358 A149359 A259223 * A320643 A060897 A005190
KEYWORD
nonn
AUTHOR
Vadim Sheikhman (vvsshh(AT)gmail.com), Nov 02 2009
EXTENSIONS
More terms from Vladeta Jovovic, Nov 02 2009
STATUS
approved