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.

A262951 a(1) = 1, a(2) = 3, a(3) = 4 and for n>=4, a(n) = (a(n-3)+a(n-2)+a(n-1)+k) mod 10 where k = a(n/6) if n is divisible by 6, else 0.

Table of values

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

List of values

[1, 3, 4, 8, 5, 7, 0, 2, 9, 1, 2, 5, 8, 5, 8, 1, 4, 7, 2, 3, 2, 7, 2, 9, 8, 9, 6, 3, 8, 2, 3, 3, 8, 4, 5, 4, 3, 2, 9, 4, 5, 8, 7, 0, 5, 2, 7, 6, 5, 8, 9, 2, 9, 9, 0, 8, 7, 5, 0, 3, 8, 1, 2, 1, 4, 9, 4, 7, 0, 1, 8, 4, 3, 5, 2, 0, 7, 7, 4, 8, 9, 1, 8, 3, 2, 3, 8]