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.

A111132 a(n+1) = a(n) + (a(n) - a(n-1) + a(n) mod 10) mod 10 with a(0)=0 and a(1)=1.

Table of values

n a(n)
0 1
1 3
2 8
3 11
4 15
5 24
6 27
7 27
8 34
9 35
10 41
11 48
12 53
13 61
14 70
15 79
16 87
17 92
18 99
19 105
20 106
21 113
22 113
23 116
24 125
25 129
26 132
27 137
28 139
29 140
30 141
31 143
32 148
33 151
34 155
35 164
36 167
37 167
38 174
39 175
40 181
41 188
42 193
43 201
44 210
45 219
46 227
47 232
48 239
49 245
50 246
51 253
52 253
53 256
54 265
55 269
56 272

List of values

[1, 3, 8, 11, 15, 24, 27, 27, 34, 35, 41, 48, 53, 61, 70, 79, 87, 92, 99, 105, 106, 113, 113, 116, 125, 129, 132, 137, 139, 140, 141, 143, 148, 151, 155, 164, 167, 167, 174, 175, 181, 188, 193, 201, 210, 219, 227, 232, 239, 245, 246, 253, 253, 256, 265, 269, 272]