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.

A157629 A general recursion triangle with third part a power triangle:m=2; Power triangle: f(n,k,m)=If[n*k*(n - k) == 0, 1, n^m - (k^m + (n - k)^m)]; Recursion: A(n,k,m)=(m*(n - k) + 1)*A(n - 1, k - 1, m) + (m*k + 1)*A(n - 1, k, m) + m*f(n, k, m)*A(n - 2, k - 1, m).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 10
5 1
6 1
7 43
8 43
9 1
10 1
11 148
12 590
13 148
14 1
15 1
16 469
17 5018
18 5018
19 469
20 1
21 1
22 1438
23 34047
24 91492
25 34047
26 1438
27 1
28 1
29 4351
30 204813
31 1187731
32 1187731
33 204813
34 4351
35 1
36 1
37 13096
38 1149652
39 12609880
40 27234646
41 12609880
42 1149652
43 13096
44 1
45 1
46 39337

List of values

[1, 1, 1, 1, 10, 1, 1, 43, 43, 1, 1, 148, 590, 148, 1, 1, 469, 5018, 5018, 469, 1, 1, 1438, 34047, 91492, 34047, 1438, 1, 1, 4351, 204813, 1187731, 1187731, 204813, 4351, 1, 1, 13096, 1149652, 12609880, 27234646, 12609880, 1149652, 13096, 1, 1, 39337]