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.

A276825 Number of ways to write n as x^3 + P_2, where x and P_2 are positive integers with P_2 a product of at most two primes.

Table of values

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

List of values

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

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

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