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.

A022879 The number of numbers [ [ ix ]jx ] that equal n, where i >= 1, j >= 1 and x=(1+sqrt(5))/2. a(n)=0 iff n is in Beatty sequence A001950.

Table of values

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

List of values

[1, 0, 1, 2, 0, 2, 0, 1, 3, 0, 1, 3, 0, 3, 0, 1, 2, 0, 5, 0, 1, 2, 0, 2, 4, 0, 2, 0, 4, 2, 0, 2, 3, 0, 3, 0, 1, 7, 0, 2, 0, 1, 4, 0, 3, 2, 0, 4, 0, 1, 5, 0, 4, 0, 2, 2, 0, 6, 2, 0, 3, 0, 2, 4, 0, 1, 6, 0, 2, 0, 4, 4, 0, 2, 0, 1, 9, 0, 1, 3, 0, 4, 0, 2, 2, 0, 5, 3, 0, 5]