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.

A111975 Triangle P, read by rows, that satisfies [P^2](n,k) = P(n+1,k+1) for n>=k>=0, also [P^(2*m)](n,k) = [P^m](n+1,k+1) for all m, where [P^m](n,k) denotes the element at row n, column k, of the matrix power m of P, with P(k,k)=1 and P(k+2,2)=P(k+2,0) for k>=0.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 1
6 4
7 4
8 4
9 1
10 16
11 16
12 16
13 8
14 1
15 96
16 96
17 96
18 64
19 16
20 1
21 896
22 896
23 896
24 704
25 256
26 32
27 1
28 13568
29 13568
30 13568
31 11776
32 5504
33 1024
34 64
35 1
36 345088
37 345088
38 345088
39 317952
40 178176
41 43776
42 4096
43 128
44 1
45 15112192
46 15112192
47 15112192
48 14422016

List of values

[1, 1, 1, 1, 2, 1, 4, 4, 4, 1, 16, 16, 16, 8, 1, 96, 96, 96, 64, 16, 1, 896, 896, 896, 704, 256, 32, 1, 13568, 13568, 13568, 11776, 5504, 1024, 64, 1, 345088, 345088, 345088, 317952, 178176, 43776, 4096, 128, 1, 15112192, 15112192, 15112192, 14422016]