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.

A357825 Total number of n-tuples of semi-Dyck paths from (0,0) to (n,n-2*j) for j = 0..floor(n/2).

Table of values

n a(n)
0 1
1 1
2 2
3 9
4 98
5 4150
6 562692
7 211106945
8 404883552194
9 1766902576146876
10 40519034229909243476
11 2708397617879598970178238
12 658332084097982587522119612196
13 735037057881394837614680080889845116
14 2030001034486747324990010196845670569155080

List of values

[1, 1, 2, 9, 98, 4150, 562692, 211106945, 404883552194, 1766902576146876, 40519034229909243476, 2708397617879598970178238, 658332084097982587522119612196, 735037057881394837614680080889845116, 2030001034486747324990010196845670569155080]

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

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