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.

A086565 Smallest k such that (10^k - 1)/9 has n distinct prime divisors. Or a(n)= smallest value of k such that A000042(k) has exactly n distinct prime divisors.

Table of values

n a(n)
0 1
1 2
2 3
3 9
4 8
5 6
6 15
7 12
8 18
9 45
10 24
11 32
12 54
13 30
14 42
15 64
16 102
17 72
18 108
19 154
20 60
21 84
22 96
23 140
24 126
25 200
26 120
27 204
28 308
29 168
30 192
31 280
32 180
33 210
34 240
35 252
36 330

List of values

[1, 2, 3, 9, 8, 6, 15, 12, 18, 45, 24, 32, 54, 30, 42, 64, 102, 72, 108, 154, 60, 84, 96, 140, 126, 200, 120, 204, 308, 168, 192, 280, 180, 210, 240, 252, 330]