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.

A267809 a(1)=a(2)=1; if n>2 then a(n) = a(n-2) + (a(n-1) mod 10).

Table of values

n a(n)
1 1
2 1
3 2
4 3
5 5
6 8
7 13
8 11
9 14
10 15
11 19
12 24
13 23
14 27
15 30
16 27
17 37
18 34
19 41
20 35
21 46
22 41
23 47
24 48
25 55
26 53
27 58
28 61
29 59
30 70
31 59
32 79
33 68
34 87
35 75
36 92
37 77
38 99
39 86
40 105
41 91
42 106
43 97
44 113
45 100
46 113
47 103
48 116
49 109
50 125
51 114
52 129
53 123
54 132
55 125
56 137
57 132
58 139
59 141
60 140
61 141
62 141
63 142
64 143
65 145
66 148
67 153

List of values

[1, 1, 2, 3, 5, 8, 13, 11, 14, 15, 19, 24, 23, 27, 30, 27, 37, 34, 41, 35, 46, 41, 47, 48, 55, 53, 58, 61, 59, 70, 59, 79, 68, 87, 75, 92, 77, 99, 86, 105, 91, 106, 97, 113, 100, 113, 103, 116, 109, 125, 114, 129, 123, 132, 125, 137, 132, 139, 141, 140, 141, 141, 142, 143, 145, 148, 153]

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

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