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.

A119466 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 z values.

Table of values

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

List of values

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