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.

A335002 Integers m such that omega(F(m)) = omega(L(m)) where omega is the number of distinct prime divisors function, F(n) and L(n) are the n-th Fibonacci and n-th Lucas numbers.

Table of values

n a(n)
1 1
2 3
3 4
4 5
5 7
6 9
7 10
8 11
9 13
10 14
11 15
12 17
13 18
14 21
15 26
16 33
17 42
18 46
19 47
20 55
21 58
22 66
23 69
24 73
25 77
26 85
27 89
28 93
29 102
30 103
31 107
32 111
33 117
34 121
35 123
36 132
37 139
38 167
39 171
40 177
41 179
42 181
43 187
44 201
45 205
46 207
47 213
48 219
49 221
50 233
51 241
52 246
53 247
54 253
55 257
56 262
57 267
58 269
59 273
60 279
61 281
62 282
63 293
64 295

List of values

[1, 3, 4, 5, 7, 9, 10, 11, 13, 14, 15, 17, 18, 21, 26, 33, 42, 46, 47, 55, 58, 66, 69, 73, 77, 85, 89, 93, 102, 103, 107, 111, 117, 121, 123, 132, 139, 167, 171, 177, 179, 181, 187, 201, 205, 207, 213, 219, 221, 233, 241, 246, 247, 253, 257, 262, 267, 269, 273, 279, 281, 282, 293, 295]