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.

A174869 a(n) is 0 if n is a power of 2, otherwise the smallest k > 0 such that A006530(n+k) < A006530(n).

Table of values

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

List of values

[0, 0, 1, 0, 1, 2, 1, 0, 7, 2, 1, 4, 1, 1, 1, 0, 1, 14, 1, 4, 3, 2, 1, 8, 2, 1, 5, 2, 1, 2, 1, 0, 2, 1, 1, 28, 1, 1, 1, 8, 1, 3, 1, 1, 3, 2, 1, 16, 1, 4, 1, 2, 1, 10, 1, 4, 3, 2, 1, 4, 1, 1, 1, 0, 1, 4, 1, 2, 1, 2, 1, 56, 1, 1, 6, 1, 3, 2, 1, 1, 47, 2, 1, 6, 3, 1, 1, 2, 1, 6, 5, 3, 2, 1, 1, 32, 1, 2, 1, 8, 1, 2, 1]