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.

A255679 Least number k such that pi(k*n)^2 = pi(i*n)^2 + pi(j*n)^2 for some 0 < i < j < k.

Table of values

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

List of values

[4, 6, 4, 12, 6, 17, 17, 6, 11, 6, 13, 14, 4, 10, 31, 35, 10, 8, 20, 20, 70, 20, 34, 23, 47, 17, 44, 25, 5, 46, 4, 26, 53, 13, 29, 33, 35, 45, 65, 10, 18, 64, 117, 21, 77, 19, 71, 101, 44, 80, 28, 93, 36, 183, 100, 98, 55, 4, 53, 81, 31, 120, 58, 40, 53, 56, 34, 49, 181, 218]