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.

A355735 Number of ways to choose a divisor of each prime index of n (taken in weakly increasing order) such that the result is weakly increasing.

Table of values

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

List of values

[1, 1, 2, 1, 2, 2, 3, 1, 3, 2, 2, 2, 4, 3, 3, 1, 2, 3, 4, 2, 5, 2, 3, 2, 3, 4, 4, 3, 4, 3, 2, 1, 3, 2, 4, 3, 6, 4, 7, 2, 2, 5, 4, 2, 4, 3, 4, 2, 6, 3, 3, 4, 5, 4, 3, 3, 7, 4, 2, 3, 6, 2, 7, 1, 6, 3, 2, 2, 5, 4, 6, 3, 4, 6, 4, 4, 4, 7, 4, 2, 5, 2, 2, 5, 3, 4, 7]

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

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