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.

A177787 Number of paths from (0,0) to (n+2,n) using only up and right steps and avoiding two or more consecutive moves up or three or more consecutive moves right.

Table of values

n a(n)
1 2
2 5
3 10
4 18
5 30
6 47
7 70
8 100
9 138
10 185
11 242
12 310
13 390
14 483
15 590
16 712
17 850
18 1005
19 1178
20 1370
21 1582
22 1815
23 2070
24 2348
25 2650
26 2977
27 3330
28 3710
29 4118
30 4555
31 5022
32 5520
33 6050
34 6613
35 7210
36 7842
37 8510
38 9215
39 9958
40 10740
41 11562
42 12425
43 13330
44 14278
45 15270

List of values

[2, 5, 10, 18, 30, 47, 70, 100, 138, 185, 242, 310, 390, 483, 590, 712, 850, 1005, 1178, 1370, 1582, 1815, 2070, 2348, 2650, 2977, 3330, 3710, 4118, 4555, 5022, 5520, 6050, 6613, 7210, 7842, 8510, 9215, 9958, 10740, 11562, 12425, 13330, 14278, 15270]