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.

A355647 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number that has not yet appeared that has the same number of divisors as the sum a(n-2) + a(n-1).

Table of values

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

List of values

[1, 2, 3, 5, 6, 7, 11, 12, 13, 4, 17, 8, 9, 19, 18, 23, 29, 20, 25, 28, 31, 37, 32, 10, 24, 14, 15, 41, 30, 43, 47, 60, 53, 59, 48, 61, 67, 40, 71, 21, 44, 22, 42, 64, 26, 72, 45, 50, 27, 33, 84, 52, 54, 34, 56, 90, 35, 38, 73, 39, 80, 46, 96, 51, 63, 66, 55, 49, 70, 57, 79, 78, 83, 58, 62, 120]