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.

A052141 Number of paths from (0,0) to (n,n) that always move closer to (n,n) (and do not pass (n,n) and backtrack).

Table of values

n a(n)
0 1
1 3
2 26
3 252
4 2568
5 26928
6 287648
7 3112896
8 34013312
9 374416128
10 4145895936
11 46127840256
12 515268544512
13 5775088103424
14 64912164888576
15 731420783788032
16 8259345993203712
17 93443504499523584
18 1058972245409005568
19 12019152955622817792
20 136599995048232747008

List of values

[1, 3, 26, 252, 2568, 26928, 287648, 3112896, 34013312, 374416128, 4145895936, 46127840256, 515268544512, 5775088103424, 64912164888576, 731420783788032, 8259345993203712, 93443504499523584, 1058972245409005568, 12019152955622817792, 136599995048232747008]

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

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