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.

A355636 a(1) = a(2) = 1; 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) but does not equal the sum.

Table of values

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

List of values

[1, 1, 3, 9, 18, 6, 30, 100, 24, 12, 196, 48, 20, 28, 80, 60, 72, 84, 90, 40, 42, 8, 32, 54, 10, 729, 2, 14, 81, 15, 108, 21, 22, 5, 26, 7, 27, 33, 96, 34, 56, 126, 66, 320, 35, 38, 11, 4, 39, 13, 44, 46, 132, 51, 55, 57, 162, 58, 140, 150, 70, 156, 62, 65, 17, 69, 74, 77, 19, 160, 23, 82, 78]