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.

A335001 Integers m such that d(F(m)) = d(L(m)) where d is the number of divisors function, F(n) and L(n) are respectively the n-th Fibonacci and n-th Lucas numbers.

Table of values

n a(n)
1 1
2 4
3 5
4 7
5 10
6 11
7 13
8 14
9 17
10 18
11 26
12 46
13 47
14 58
15 73
16 77
17 85
18 89
19 103
20 107
21 121
22 139
23 167
24 179
25 181
26 187
27 205
28 221
29 233
30 241
31 247
32 253
33 257
34 262
35 269
36 273
37 281
38 293
39 295
40 317
41 329
42 335
43 337
44 341
45 371
46 377
47 397
48 407
49 409
50 427
51 442
52 454
53 466
54 491
55 506
56 563
57 611

List of values

[1, 4, 5, 7, 10, 11, 13, 14, 17, 18, 26, 46, 47, 58, 73, 77, 85, 89, 103, 107, 121, 139, 167, 179, 181, 187, 205, 221, 233, 241, 247, 253, 257, 262, 269, 273, 281, 293, 295, 317, 329, 335, 337, 341, 371, 377, 397, 407, 409, 427, 442, 454, 466, 491, 506, 563, 611]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.