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.

A075053 Number of primes (counted with repetition) that can be formed by rearranging some or all of the digits of n.

Table of values

n a(n)
0 0
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 3
14 1
15 1
16 1
17 3
18 0
19 1
20 1
21 1
22 2
23 3
24 1
25 2
26 1
27 2
28 1
29 2
30 1
31 3
32 3
33 2
34 2
35 3
36 1
37 4
38 2
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 2
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 3
72 2
73 4
74 2
75 2
76 2
77 2
78 1
79 3
80 0
81 0
82 1
83 2
84 0
85 1
86 0
87 1
88 0
89 1
90 0
91 1
92 2
93 1
94 0
95 2
96 0
97 3
98 1
99 0
100 0
101 2
102 1
103 4
104 2

List of values

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