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.

A249337 a(1) = 1, a(2) = 2; for n>2, a(n) = number of values k in range 1 .. n-1 such that {sum of prime indices in the prime factorization of a(k)} = {sum of prime indices in the prime factorization of a(n-1)}, both counted with multiplicity.

Table of values

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

List of values

[1, 2, 1, 2, 2, 3, 1, 3, 2, 4, 3, 4, 5, 1, 4, 6, 2, 5, 3, 7, 1, 5, 4, 8, 5, 6, 7, 2, 6, 8, 9, 3, 9, 4, 10, 5, 10, 6, 11, 1, 6, 12, 7, 8, 13, 1, 7, 9, 10, 11, 2, 7, 12, 13, 2, 8, 14, 3, 11, 4, 12, 14, 5, 15, 6, 16, 15, 7, 16, 17, 1, 8, 17, 2, 9, 18, 8, 18, 9, 19, 1, 9, 20, 10, 21, 3, 13, 4, 14, 11, 12, 22, 5, 19, 2, 10, 23, 1]