OFFSET
7,3
COMMENTS
LINKS
EXAMPLE
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.
PROG
(Fortran) c Program provided at given link
CROSSREFS
KEYWORD
more,nonn
AUTHOR
Hugo Pfoertner, Nov 27 2002
STATUS
approved