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.

A074080 Triangle T(n,k) (listed in order T(1,0), T(2,0), T(2,1), T(3,0), T(3,1), T(3,2), T(4,0), etc.) giving the number of 2^k-cycles that occur in the n-th sub-permutation of A069767/A069768 (i.e., in the range [A014137(n-1)..A014138(n-1)] inclusive).

Table of values

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

List of values

[1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 2, 2, 1, 0, 0, 3, 5, 3, 1, 1, 0, 3, 10, 9, 4, 1, 0, 1, 3, 17, 24, 14, 5, 1, 0, 1, 3, 28, 57, 44, 20, 6, 1, 0, 0, 5, 41, 128, 128, 71, 27, 7, 1, 0, 1, 4, 60, 271, 354, 234, 106, 35, 8, 1, 0, 0, 5, 81, 549, 937, 738, 384, 150, 44, 9, 1, 0, 0, 5, 106, 1061]