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.

A152303 a(n) = b(n) mod 10, where b(n) = b(n-1) + b(n-2) + floor(b(n-2)/10), b(0) = b(1) = 1.

Table of values

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

List of values

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