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.

A080080 T(n,k) = length of longest carry sequence when adding k to n in binary representation, 1 <= k <= n (triangular array).

Table of values

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

List of values

[1, 0, 1, 2, 1, 1, 0, 0, 0, 1, 1, 0, 3, 1, 1, 0, 2, 2, 1, 1, 1, 3, 2, 2, 1, 2, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 2, 0, 1, 0, 4, 1, 1, 0, 1, 1, 0, 0, 3, 3, 1, 1, 1, 2, 1, 1, 0, 4, 3, 3, 1, 2, 1, 1, 0, 0, 0, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 0, 4, 2, 2, 2, 2, 1, 1, 1, 3, 1, 1, 0, 3, 3, 2, 2, 2, 2, 1, 1, 2, 2, 1, 1, 1]