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.

A144656 a(n) = (n mod 2) if n <= 3, otherwise a(n) = (n^2-5n+7)*(n-2)*a(n-1)/(n-3) + (n^2-5n+7)*a(n-2) - (n-2)*a(n-3)/(n-3).

Table of values

n a(n)
0 0
1 1
2 0
3 1
4 4
5 49
6 900
7 24649
8 944784
9 48455521
10 3210355600
11 267186643801
12 27307626948900
13 3363915436531441
14 491705171699154084
15 84158959760104032049
16 16675767262618669710400
17 3787671541267275818341249
18 977702867682508392324162624
19 284628954669920840314598014801

List of values

[0, 1, 0, 1, 4, 49, 900, 24649, 944784, 48455521, 3210355600, 267186643801, 27307626948900, 3363915436531441, 491705171699154084, 84158959760104032049, 16675767262618669710400, 3787671541267275818341249, 977702867682508392324162624, 284628954669920840314598014801]