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.

A356666 Smallest m such that the m-th Lucas number has exactly n divisors that are also Lucas numbers.

Table of values

n a(n)
1 1
2 0
3 3
4 6
5 15
6 30
7 45
8 90
9 105
10 210
11 405
12 810
13 315
14 630
15 3645
16 2025
17 945
18 1890
19 1575
20 3150
21 2835
22 5670
23 36450
24 25025
25 3465
26 6930
27 101250
28 11025
29 22050
30 51030
31 14175
32 28350
33 10395
34 20790
35 2952450
36 175175
37 17325
38 34650
39 1937102445
40 625625
41 31185
42 62370
43 127575
44 255150

List of values

[1, 0, 3, 6, 15, 30, 45, 90, 105, 210, 405, 810, 315, 630, 3645, 2025, 945, 1890, 1575, 3150, 2835, 5670, 36450, 25025, 3465, 6930, 101250, 11025, 22050, 51030, 14175, 28350, 10395, 20790, 2952450, 175175, 17325, 34650, 1937102445, 625625, 31185, 62370, 127575, 255150]