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.

A247509 Number of preprimes (A156759, n>1) such that the smallest prime divisor equals prime(n).

Table of values

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

List of values

[3, 3, 2, 4, 2, 3, 2, 2, 3, 2, 4, 3, 2, 2, 3, 3, 2, 4, 3, 2, 3, 2, 2, 4, 3, 2, 3, 2, 2, 5, 2, 3, 2, 4, 2, 3, 3, 2, 3, 3, 2, 5, 2, 3, 2, 3, 5, 3, 2, 2, 3, 2, 3, 3, 3, 3, 2, 4, 3, 2, 2, 5, 3, 2, 2, 3, 2, 4, 2, 2, 2, 3, 3, 3, 2, 2, 3, 2, 2, 3, 2, 4, 2, 3, 2, 2, 4]

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

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