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.

A127137 Define an array by Q(m, 0) = 1, Q(m, 1) = 1; Q(m, 2k) = (m - 2k + 1)*Q(m+1, 2k-1) - (2k-1)*Q(m+2, 2k-2), m*Q(m, 2k+1) = (m - 2k)*Q(m+1, 2k) - 2k(m+1)*Q(m+2, 2k-1). Sequence gives Q(0,n).

Table of values

n a(n)
0 1
1 1
2 -2
3 -5
4 12
5 43
6 -120
7 -531
8 1680
9 8601
10 -30240
11 -172965
12 665280
13 4161555
14 -17297280
15 -116658675
16 518918400
17 3735104625
18 -17643225600
19 -134498225925
20 670442572800
21 5380583766075
22 -28158588057600
23 -236759435017875
24 1295295050649600
25 11364769115001225
26 -64764752532480000

List of values

[1, 1, -2, -5, 12, 43, -120, -531, 1680, 8601, -30240, -172965, 665280, 4161555, -17297280, -116658675, 518918400, 3735104625, -17643225600, -134498225925, 670442572800, 5380583766075, -28158588057600, -236759435017875, 1295295050649600, 11364769115001225, -64764752532480000]