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.

A381136 a(n) is the number of divisors d of n such that tau(d^(1 + n) + n) = 2^omega(d^(1 + n) + n), where tau = A000005 and omega = A001221.

Table of values

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

List of values

[1, 2, 0, 1, 2, 4, 0, 0, 1, 3, 0, 2, 2, 3, 0, 1, 0, 2, 0, 2, 4, 2, 0, 1, 1, 2, 0, 2, 2, 8, 0, 1, 4, 4, 0, 1, 2, 3, 0, 2, 2, 7, 0, 1, 2, 4, 0, 1, 0, 2, 0, 2, 0, 2, 0, 2, 4, 2, 0, 3, 2, 2, 0, 1, 4, 8, 0, 2, 3, 5, 0, 1, 2, 3, 0, 2, 4, 8, 0, 1, 1, 3, 0, 4, 4, 4, 0]