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.

A125087 a(1)=1. For n>1, a(n) = the number of terms (from among the first n-1 terms of the sequence) that are equal to at least one exponent in the prime factorization of n.

Table of values

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

List of values

[1, 1, 2, 1, 3, 3, 3, 3, 1, 4, 4, 5, 4, 4, 4, 5, 4, 5, 4, 5, 4, 4, 4, 8, 1, 5, 4, 6, 5, 5, 5, 8, 5, 5, 5, 1, 6, 6, 6, 10, 6, 6, 6, 7, 7, 6, 6, 17, 1, 8, 7, 8, 7, 11, 7, 11, 7, 7, 7, 8, 7, 7, 8, 9, 7, 7, 7, 8, 7, 7, 7, 5, 7, 7, 8, 8, 7, 7, 7, 18, 11, 7, 7, 8, 7, 7, 7, 11, 7, 8, 7, 8, 7, 7, 7, 19, 7, 8, 8, 1, 8]