login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051910 Triangle T(n,m) = Nim-product of n and m, read by rows, 0<=m<=n. 4
0, 0, 1, 0, 2, 3, 0, 3, 1, 2, 0, 4, 8, 12, 6, 0, 5, 10, 15, 2, 7, 0, 6, 11, 13, 14, 8, 5, 0, 7, 9, 14, 10, 13, 3, 4, 0, 8, 12, 4, 11, 3, 7, 15, 13, 0, 9, 14, 7, 15, 6, 1, 8, 5, 12, 0, 10, 15, 5, 3, 9, 12, 6, 1, 11, 14, 0, 11, 13, 6, 7, 12, 10, 1, 9, 2, 4, 15 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

0,5

REFERENCES

E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Academic Press, NY, 2 vols., 1982, see p. 60.

J. H. Conway, On Numbers and Games, Academic Press, p. 52.

LINKS

R. J. Mathar, Table of n, a(n) for n = 0..3320

Index entries for sequences related to Nim-multiplication

FORMULA

T(n,m) = A051775(n,m) = A051776(n,m).

EXAMPLE

Triangle starts

0;

0, 1;

0, 2,  3;

0, 3,  1,  2;

0, 4,  8, 12,  6;

0, 5, 10, 15,  2,  7;

0, 6, 11, 13, 14,  8, 5;

0, 7,  9, 14, 10, 13, 3,  4;

0, 8, 12,  4, 11,  3, 7, 15, 13;

MAPLE

We continue from A003987: to compute a Nim-multiplication table using (a) an addition table AT := array(0..NA, 0..NA) and (b) a nimsum procedure for larger values; MT := array(0..N, 0..N); for a from 0 to N do MT[a, 0] := 0; MT[0, a] := 0; MT[a, 1] := a; MT[1, a] := a; od: for a from 2 to N do for b from a to N do t1 := {}; for i from 0 to a-1 do for j from 0 to b-1 do u1 := MT[i, b]; u2 := MT[a, j];

if u1<=NA and u2<=NA then u12 := AT[u1, u2]; else u12 := nimsum(u1, u2); fi; u3 := MT[i, j]; if u12<=NA and u3<=NA then u4 := AT[u12, u3]; else u4 := nimsum(u12, u3); fi; t1 := { op(t1), u4}; #t1 := { op(t1), AT[ AT[ MT[i, b], MT[a, j] ], MT[i, j] ] }; od; od;

t2 := sort(convert(t1, list)); j := nops(t2); for i from 1 to nops(t2) do if t2[i] <> i-1 then j := i-1; break; fi; od; MT[a, b] := j; MT[b, a] := j; od; od;

CROSSREFS

Cf. A051776, A003987, A051775, A051911.

Sequence in context: A132385 A191716 A089235 * A137998 A080593 A193682

Adjacent sequences:  A051907 A051908 A051909 * A051911 A051912 A051913

KEYWORD

tabl,nonn,easy,nice

AUTHOR

N. J. A. Sloane, Dec 20 1999

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 19 08:51 EST 2017. Contains 294923 sequences.