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.

A346972 a(1)=1, a(2)=4, a(n) = (n*a(n-1) - (n-1)*a(n-2)) mod (n+1).

Table of values

n a(n)
1 1
2 4
3 2
4 1
5 3
6 6
7 0
8 3
9 7
10 10
11 4
12 3
13 5
14 1
15 9
16 10
17 8
18 12
19 4
20 20
21 10
22 7
23 13
24 1
25 25
26 4
27 18
28 19
29 17
30 21
31 13
32 29
33 31
34 27
35 35
36 19
37 13
38 25
39 1
40 8
41 36
42 23
43 5
44 41
45 15
46 20
47 10
48 30
49 40
50 20
51 8
52 32
53 38
54 26
55 50
56 2
57 40
58 23
59 57
60 50
61 2
62 35
63 33
64 37
65 29
66 45
67 13
68 8
69 18
70 69
71 39
72 26

List of values

[1, 4, 2, 1, 3, 6, 0, 3, 7, 10, 4, 3, 5, 1, 9, 10, 8, 12, 4, 20, 10, 7, 13, 1, 25, 4, 18, 19, 17, 21, 13, 29, 31, 27, 35, 19, 13, 25, 1, 8, 36, 23, 5, 41, 15, 20, 10, 30, 40, 20, 8, 32, 38, 26, 50, 2, 40, 23, 57, 50, 2, 35, 33, 37, 29, 45, 13, 8, 18, 69, 39, 26]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.