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.

A157013 Riordan's general Eulerian recursion: T(n, k) = (k+2)*T(n-1, k) + (n-k-1) * T(n-1, k-1) with T(n,1) = 1, T(n,n) = (-1)^(n-1).

Table of values

n a(n)
1 1
2 1
3 -1
4 1
5 -4
6 1
7 1
8 -15
9 5
10 -1
11 1
12 -58
13 10
14 -6
15 1
16 1
17 -229
18 -66
19 -26
20 7
21 -1
22 1
23 -912
24 -1017
25 -288
26 23
27 -8
28 1
29 1
30 -3643
31 -8733
32 -4779
33 -415
34 -41
35 9
36 -1
37 1
38 -14566
39 -61880
40 -63606
41 -17242
42 -1158
43 40
44 -10
45 1
46 1
47 -58257
48 -396796
49 -691036
50 -375118
51 -60990
52 -1956
53 -60
54 11
55 -1

List of values

[1, 1, -1, 1, -4, 1, 1, -15, 5, -1, 1, -58, 10, -6, 1, 1, -229, -66, -26, 7, -1, 1, -912, -1017, -288, 23, -8, 1, 1, -3643, -8733, -4779, -415, -41, 9, -1, 1, -14566, -61880, -63606, -17242, -1158, 40, -10, 1, 1, -58257, -396796, -691036, -375118, -60990, -1956, -60, 11, -1]