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.

A355702 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 prime 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 8
6 7
7 4
8 11
9 6
10 13
11 17
12 12
13 19
14 23
15 18
16 29
17 31
18 16
19 37
20 41
21 20
22 43
23 27
24 28
25 9
26 47
27 24
28 53
29 10
30 30
31 36
32 42
33 44
34 14
35 15
36 59
37 21
38 32
39 61
40 22
41 67
42 71
43 45
44 50
45 25
46 52
47 26
48 63
49 73
50 40
51 79
52 33
53 48
54 54
55 66
56 72
57 68
58 56
59 70
60 60
61 75
62 81
63 84
64 76
65 64
66 88
67 90
68 34
69 78
70 80
71 35
72 38
73 83
74 39
75 46
76 49
77 51

List of values

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