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!)
A063001 Number of paths of length n+2 originating at a non-corner edge of 4 X 4 Boggle board. 2
5, 24, 109, 435, 1512, 4621, 12463, 29565, 60596, 104542, 147032, 161759, 130777, 68989, 17681 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
A legal walk on a Boggle board is from one vertex to a vertex adjacent orthogonally or diagonally.
LINKS
Eugene McDonnell, Remarks on Game of "Boggle"
FORMULA
Formula unknown, values computed empirically.
PROG
(Python)
def nn(c): # neighbors of c
i, j = divmod(c, 4)
N = set((i+io, j+jo) for io in [-1, 0, 1] for jo in [-1, 0, 1]) - {(i, j)}
return [4*i+j for i, j in N if 0 <= i < 4 and 0 <= j < 4]
def afind():
n, paths = 0, {(1, )}
while n+2 <= 16:
paths1 = set(p + (e, ) for p in paths for e in nn(p[-1]) if e not in p)
print(len(paths1), end=", ")
n, paths = n+1, paths1
afind() # Michael S. Branicky, May 24 2021
CROSSREFS
Sequence in context: A270186 A008464 A291010 * A000953 A183934 A171310
KEYWORD
fini,full,nonn
AUTHOR
Eugene McDonnell (EEMcD(AT)AOL.com), Jul 01 2001
STATUS
approved

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 March 28 07:20 EDT 2024. Contains 371235 sequences. (Running on oeis4.)