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.

A131183 a(n) = a(n-1) + a(n-2) if n == 3 mod 4; a(n) = a(n-1) - a(n-2) if n == 0 mod 4; a(n) = a(n-1)*a(n-2) if n == 1 mod 4; and a(n) = a(n-1)/a(n-2) if n == 2 mod 4; with a(1)=a(2)=1.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 2
6 2
7 4
8 2
9 8
10 4
11 12
12 8
13 96
14 12
15 108
16 96
17 10368
18 108
19 10476
20 10368
21 108615168
22 10476
23 108625644
24 108615168
25 11798392572168192
26 108625644
27 11798392680793836
28 11798392572168192
29 139202068568601556987554268864512

List of values

[1, 1, 2, 1, 2, 2, 4, 2, 8, 4, 12, 8, 96, 12, 108, 96, 10368, 108, 10476, 10368, 108615168, 10476, 108625644, 108615168, 11798392572168192, 108625644, 11798392680793836, 11798392572168192, 139202068568601556987554268864512]