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.

A258567 a(1) = 1; thereafter a(n) = smallest prime factor of the powerful number A001694(n).

Table of values

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

List of values

[1, 2, 2, 3, 2, 5, 3, 2, 2, 7, 2, 2, 3, 2, 2, 11, 5, 2, 2, 13, 2, 2, 2, 3, 3, 2, 2, 17, 2, 7, 19, 2, 2, 2, 3, 2, 2, 2, 23, 2, 5, 2, 3, 2, 3, 2, 2, 29, 2, 2, 31, 2, 2, 2, 2, 3, 3, 2, 2, 5, 2, 3, 11, 2, 37, 2, 2, 3, 2, 2, 41, 2, 2, 2, 43, 2, 2, 2, 3, 2, 2, 3]

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

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