cp's OEIS Frontend

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.

A078528 Number of unconstrained walks on square lattice trapped after n steps.

Original entry on oeis.org

1, 1, 2, 5, 15, 30, 76, 170, 422, 961, 2339, 5390, 12977, 30059, 71918, 167019, 397691, 924931, 2194478, 5107991, 12085695, 28143758, 66442935, 154759821, 364706675, 849562628
Offset: 7

Views

Author

Hugo Pfoertner, Nov 27 2002

Keywords

Comments

See under A078527. In the probability sum in A077483 and A078526 the unconstrained walks are responsible for the occurrence of 3^(n-1) in the denominator of P(n).

Examples

			a(7)=1 because the unique shortest walk contains no constrained steps. a(10)=5: See illustration in "5 Unconstrained and 7 maximally 2-constrained walks of length 10" given at link.
		

Crossrefs

Programs

  • Fortran
    c Program provided at given link

Extensions

a(24)-a(32) from Sean A. Irvine, Jul 03 2025