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.

A113084 Triangle T, read by rows, that satisfies the recurrence: T(n,k) = [T^3](n-1,k-1) + [T^3](n-1,k) for n>k>=0, with T(n,n)=1 for n>=0, where T^3 is the matrix third power of T.

Table of values

n a(n)
0 1
1 1
2 1
3 3
4 4
5 1
6 21
7 33
8 13
9 1
10 331
11 586
12 294
13 40
14 1
15 11973
16 23299
17 13768
18 2562
19 121
20 1
21 1030091
22 2166800
23 1447573
24 333070
25 22569
26 364
27 1
28 218626341
29 490872957
30 361327779
31 97348117
32 8466793
33 200931
34 1093
35 1
36 118038692523
37 280082001078

List of values

[1, 1, 1, 3, 4, 1, 21, 33, 13, 1, 331, 586, 294, 40, 1, 11973, 23299, 13768, 2562, 121, 1, 1030091, 2166800, 1447573, 333070, 22569, 364, 1, 218626341, 490872957, 361327779, 97348117, 8466793, 200931, 1093, 1, 118038692523, 280082001078]