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.

A074867 a(n) = M(a(n-1)) + M(a(n-2)) where a(1)=a(2)=1 and M(k) is the product of the digits of k in base 10.

Table of values

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

List of values

[1, 1, 2, 3, 5, 8, 13, 11, 4, 5, 9, 14, 13, 7, 10, 7, 7, 14, 11, 5, 6, 11, 7, 8, 15, 13, 8, 11, 9, 10, 9, 9, 18, 17, 15, 12, 7, 9, 16, 15, 11, 6, 7, 13, 10, 3, 3, 6, 9, 15, 14, 9, 13, 12, 5, 7, 12, 9, 11, 10, 1, 1, 2, 3, 5, 8, 13, 11, 4, 5, 9, 14, 13, 7, 10, 7, 7, 14, 11, 5, 6, 11, 7, 8, 15, 13]