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.

A126086 Number of paths from (0,0,0) to (n,n,n) such that at each step (i) at least one coordinate increases, (ii) no coordinate decreases, (iii) no coordinate increases by more than 1 and (iv) all coordinates are integers.

Table of values

n a(n)
0 1
1 13
2 409
3 16081
4 699121
5 32193253
6 1538743249
7 75494983297
8 3776339263873
9 191731486403293
10 9850349744182729
11 510958871182549297
12 26716694098174738321
13 1406361374518034383189
14 74456543501901550262689
15 3961518532003397434536961
16 211689479080817606497324033

List of values

[1, 13, 409, 16081, 699121, 32193253, 1538743249, 75494983297, 3776339263873, 191731486403293, 9850349744182729, 510958871182549297, 26716694098174738321, 1406361374518034383189, 74456543501901550262689, 3961518532003397434536961, 211689479080817606497324033]