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.

A175134 a(n) = number of pairs of permutations (p, q) of the same (arbitrary) size m such that f_m(f_{m-1}(...f_1(1)...)) = n, where f_i(x) = p_i*x + q_i.

Table of values

n a(n)
1 1
2 1
3 0
4 0
5 2
6 1
7 1
8 0
9 0
10 0
11 0
12 0
13 2
14 4
15 4
16 4
17 2
18 4
19 1
20 3
21 1
22 2
23 2
24 1
25 1
26 0
27 0
28 2
29 2
30 0
31 1
32 0
33 0
34 0
35 0
36 0
37 0
38 0
39 0
40 0
41 2
42 2
43 6
44 4
45 8
46 6
47 8
48 6
49 8
50 6
51 16
52 12
53 14
54 6
55 12
56 10
57 16
58 18
59 14
60 14
61 10
62 10
63 10
64 14
65 12
66 10
67 10
68 8
69 4
70 13
71 15
72 4
73 13
74 6
75 8
76 6
77 8
78 2
79 11
80 6
81 5
82 7
83 2
84 11
85 7
86 6
87 6
88 5
89 3
90 6
91 6
92 2
93 5
94 2
95 4
96 3
97 4
98 3
99 3
100 1
101 3
102 5
103 5
104 1
105 2
106 3
107 2
108 0
109 3
110 2
111 2
112 3
113 3
114 4
115 4
116 3
117 4
118 2
119 0
120 2
121 3
122 2
123 0
124 1
125 3
126 2
127 3
128 1
129 1
130 1
131 0
132 1
133 4
134 2
135 2
136 1
137 4
138 1
139 2
140 0
141 2
142 3
143 6
144 0
145 1
146 1
147 0
148 1
149 3
150 3
151 2
152 0
153 2
154 1
155 0
156 0
157 1
158 0
159 0
160 0
161 1
162 1
163 1
164 0
165 1
166 0
167 0
168 0
169 0
170 0

List of values

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