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.

A273514 a(n) is the number of arithmetic progressions m < n < p (three numbers in arithmetic progression) such that m and p contain no 2's in their ternary representation.

Table of values

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

List of values

[0, 0, 2, 0, 0, 2, 2, 2, 2, 0, 0, 2, 0, 0, 2, 2, 2, 2, 2, 2, 8, 2, 2, 2, 2, 2, 2, 0, 0, 2, 0, 0, 2, 2, 2, 2, 0, 0, 2, 0, 0, 2, 2, 2, 2, 2, 2, 8, 2, 2, 2, 2, 2, 2, 2, 2, 8, 2, 2, 8, 8, 8, 8, 2, 2, 8, 2, 2, 2, 2, 2, 2, 2, 2, 8, 2, 2, 2, 2, 2, 2, 0, 0, 2, 0, 0, 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.