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.

A152302 a(n) = f(n) mod 10 where f(n) = f(n-1) + f(n-2) + floor(f(n-1)/10) starting f(0) = f(1) = 1.

Table of values

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

List of values

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