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.

A338497 Least number of odd cubes needed to represent n.

Table of values

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

List of values

[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 3]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.