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.

A059651 a(n) = [[(k^2)*n]-(k*[k*n])], where k = cube root of 2 and [] is the floor function.

Table of values

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

List of values

[0, -1, 0, 0, -1, -1, 0, 0, -1, 0, -1, 0, 0, -1, 0, 0, -1, -1, 0, 1, -1, 0, -1, 0, 0, -1, 0, -1, -1, 0, 0, -1, -1, 0, 0, -1, 0, 0, 0, -1, 0, 0, 0, -1, -1, 0, 1, -1, 0, 0, 0, -1, 0, 0, -1, 0, -1, 0, 0, -1, 0, 0, -1, 0, 0, 0, -1, 0, -1, 0, 0, -1, 0, 0, -1, 0, 0, -1, -1, 0, 0, -1, 0, -1, 0, -1, -1, 0, 0, -1, -1, 0, 1, -1, 0, 0, 0, -1, 0, 0, 0, -1, -1, 0, -1, -1, 0, 0, -1, 0, 0, 0, -1, 0, -1, 0, 0, -1, 0, 0]