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.

A119465 Consider the standard game of Nim with 3 heaps and make a list of the losing positions (x,y,z) with x <= y <= z sorted by sum, ties broken by putting smallest value of x first, then y, then z; sequence gives y values.

Table of values

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

List of values

[0, 1, 2, 3, 2, 4, 5, 4, 6, 4, 7, 6, 5, 4, 5, 8, 9, 8, 10, 8, 11, 10, 9, 8, 9, 12, 8, 13, 12, 9, 8, 9, 14, 12, 10, 8, 10, 15, 14, 13, 12, 13, 11, 10, 11, 9, 11, 8, 9, 10, 11, 16, 17, 16, 18, 16, 19, 18, 17, 16, 17, 20, 16, 21, 20, 17, 16, 17, 22, 20, 18, 16, 18, 23, 22, 21, 20, 21, 19, 18]