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.

A061501 a(1) = 1, a(n+1) = (a(n) + n) mod 10.

Table of values

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

List of values

[1, 2, 4, 7, 1, 6, 2, 9, 7, 6, 6, 7, 9, 2, 6, 1, 7, 4, 2, 1, 1, 2, 4, 7, 1, 6, 2, 9, 7, 6, 6, 7, 9, 2, 6, 1, 7, 4, 2, 1, 1, 2, 4, 7, 1, 6, 2, 9, 7, 6, 6, 7, 9, 2, 6, 1, 7, 4, 2, 1, 1, 2, 4, 7, 1, 6, 2, 9, 7, 6, 6, 7, 9, 2, 6, 1, 7, 4, 2, 1, 1, 2, 4, 7, 1, 6, 2, 9, 7, 6, 6, 7, 9, 2, 6, 1, 7, 4, 2, 1, 1, 2, 4, 7, 1]

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

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