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.

A343310 a(n) is the number of bilaterally symmetrical self-avoiding paths connecting consecutive corners of an n X n triangular grid.

Table of values

n a(n)
1 1
2 2
3 4
4 12
5 50
6 264
7 2054
8 22324
9 377704
10 9455172
11 385118374
12 23504746636
13 2346325946460
14 348814672315896
15 84278783653480026
16 30255270733134656280
17 17646594353716082850430
18 15321207204408662854455924
19 21654163559101840305705453010
20 45620955950222177660249163228084

List of values

[1, 2, 4, 12, 50, 264, 2054, 22324, 377704, 9455172, 385118374, 23504746636, 2346325946460, 348814672315896, 84278783653480026, 30255270733134656280, 17646594353716082850430, 15321207204408662854455924, 21654163559101840305705453010, 45620955950222177660249163228084]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.