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.

A357655 Total number of nodes summed over all lattice paths from (0,0) to (i,n-2*i) that do not go above the diagonal x=y using steps in {(1,0), (0,1)}.

Table of values

n a(n)
0 1
1 0
2 2
3 3
4 3
5 8
6 14
7 15
8 35
9 59
10 69
11 147
12 245
13 300
14 608
15 1005
16 1269
17 2489
18 4091
19 5280
20 10120
21 16565
22 21735
23 40950
24 66820
25 88815
26 165125
27 268785
28 361005
29 664108
30 1078904
31 1461609
32 2665617
33 4323643
34 5899917
35 10682712
36 17304516
37 23759955
38 42759385
39 69187281

List of values

[1, 0, 2, 3, 3, 8, 14, 15, 35, 59, 69, 147, 245, 300, 608, 1005, 1269, 2489, 4091, 5280, 10120, 16565, 21735, 40950, 66820, 88815, 165125, 268785, 361005, 664108, 1078904, 1461609, 2665617, 4323643, 5899917, 10682712, 17304516, 23759955, 42759385, 69187281]