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.

A039995 Number of distinct primes which occur as subsequences of the sequence of digits of n.

Table of values

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

List of values

[0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 2, 0, 1, 0, 2, 0, 1, 1, 1, 1, 3, 1, 2, 1, 2, 1, 2, 1, 2, 2, 1, 1, 2, 1, 3, 1, 1, 0, 1, 1, 2, 0, 1, 0, 2, 0, 0, 1, 1, 2, 3, 1, 1, 1, 2, 1, 2, 0, 1, 1, 1, 0, 1, 0, 2, 0, 0, 1, 2, 2, 3, 1, 2, 1, 1, 1, 2, 0, 0, 1, 2, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 2, 0, 0, 0, 2, 1, 3, 0, 1]