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.

A380891 If n mod 2 = 0 then a(n) = floor(n^(1/3)) else a(n) = floor(n^(4/3)).

Table of values

n a(n)
0 0
1 1
2 1
3 4
4 1
5 8
6 1
7 13
8 2
9 18
10 2
11 24
12 2
13 30
14 2
15 36
16 2
17 43
18 2
19 50
20 2
21 57
22 2
23 65
24 2
25 73
26 2
27 81
28 3
29 89
30 3
31 97
32 3
33 105
34 3
35 114
36 3
37 123
38 3
39 132
40 3
41 141
42 3
43 150
44 3
45 160
46 3
47 169
48 3
49 179
50 3
51 189
52 3
53 199
54 3
55 209
56 3
57 219
58 3
59 229
60 3
61 240
62 3
63 250
64 4
65 261
66 4
67 272

List of values

[0, 1, 1, 4, 1, 8, 1, 13, 2, 18, 2, 24, 2, 30, 2, 36, 2, 43, 2, 50, 2, 57, 2, 65, 2, 73, 2, 81, 3, 89, 3, 97, 3, 105, 3, 114, 3, 123, 3, 132, 3, 141, 3, 150, 3, 160, 3, 169, 3, 179, 3, 189, 3, 199, 3, 209, 3, 219, 3, 229, 3, 240, 3, 250, 4, 261, 4, 272]