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.

A135592 a(1)=1; for n > 1, a(n) is number of earlier terms equal to number of prime divisors of n.

Table of values

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

List of values

[1, 1, 2, 2, 2, 3, 2, 2, 2, 6, 2, 7, 2, 8, 8, 2, 2, 10, 2, 11, 11, 11, 2, 12, 2, 13, 2, 14, 2, 1, 3, 3, 15, 15, 15, 15, 3, 15, 15, 15, 3, 5, 3, 15, 15, 15, 3, 15, 3, 15, 15, 15, 3, 15, 15, 15, 15, 15, 3, 10, 3, 15, 15, 3, 15, 12, 3, 15, 15, 13, 3, 15, 3, 15, 15, 15, 15, 15, 3, 15, 3, 15, 3, 18]

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

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