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.

A276830 Number of ways to write n as ((p-1)/2)^2 + P_2, where p is an odd prime and P_2 is a product of at most two primes.

Table of values

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

List of values

[0, 1, 1, 1, 2, 2, 2, 2, 1, 3, 3, 2, 2, 3, 3, 2, 1, 3, 2, 2, 1, 2, 3, 2, 1, 4, 3, 2, 2, 4, 2, 3, 1, 3, 4, 2, 2, 5, 4, 4, 2, 5, 3, 3, 2, 3, 5, 3, 1, 5, 3, 2, 2, 2, 3, 3, 2, 4, 4, 3, 2, 5, 3, 2, 3, 5, 3, 4, 3, 4, 5, 2, 3, 5, 4, 2, 3, 5, 2, 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.