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.

A289630 Number of modulo n residues among sums of two sixth powers.

Table of values

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

List of values

[1, 2, 3, 3, 5, 6, 3, 3, 3, 10, 11, 9, 5, 6, 15, 5, 17, 6, 10, 15, 9, 22, 23, 9, 25, 10, 7, 9, 29, 30, 16, 9, 33, 34, 15, 9, 19, 20, 15, 15, 41, 18, 29, 33, 15, 46, 47, 15, 15, 50, 51, 15, 53, 14, 55, 9, 30, 58, 59, 45, 51, 32, 9, 17, 25, 66, 56, 51, 69, 30, 71]

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

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