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.

A363162 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 distinct prime divisors as a(n-2) + a(n-1).

Table of values

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

List of values

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