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.

A060693 Triangle (0 <= k <= n) read by rows: T(n, k) is the number of Schröder paths from (0,0) to (2n,0) having k peaks.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 3
5 1
6 5
7 10
8 6
9 1
10 14
11 35
12 30
13 10
14 1
15 42
16 126
17 140
18 70
19 15
20 1
21 132
22 462
23 630
24 420
25 140
26 21
27 1
28 429
29 1716
30 2772
31 2310
32 1050
33 252
34 28
35 1
36 1430
37 6435
38 12012
39 12012
40 6930
41 2310
42 420
43 36
44 1
45 4862
46 24310
47 51480
48 60060
49 42042
50 18018
51 4620
52 660
53 45
54 1
55 16796

List of values

[1, 1, 1, 2, 3, 1, 5, 10, 6, 1, 14, 35, 30, 10, 1, 42, 126, 140, 70, 15, 1, 132, 462, 630, 420, 140, 21, 1, 429, 1716, 2772, 2310, 1050, 252, 28, 1, 1430, 6435, 12012, 12012, 6930, 2310, 420, 36, 1, 4862, 24310, 51480, 60060, 42042, 18018, 4620, 660, 45, 1, 16796]