The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A253586 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A253586

The sum of the i-th ternary digits of n, k, and A(n,k) equals 0 (mod 3) for each i>=0 (leading zeros included); square array A(n,k), n>=0, k>=0, read by antidiagonals.
(history; published version)

#28 by Alois P. Heinz at Tue Jan 19 14:35:37 EST 2021

STATUS

proposed

approved

#27 by Rémy Sigrist at Tue Jan 19 14:24:18 EST 2021

STATUS

editing

proposed

Discussion

Tue Jan 19

14:35

Alois P. Heinz: nice, thanks!

#26 by Rémy Sigrist at Tue Jan 19 14:20:59 EST 2021

LINKS

Wikipedia, <a href="https://en.wikipedia.org/wiki/Set_(game)">Set (game)</a>

Discussion

Tue Jan 19

14:24

Rémy Sigrist: added scatterplot

#25 by Rémy Sigrist at Tue Jan 19 14:20:44 EST 2021

LINKS

Rémy Sigrist, <a href="/A253586/a253586.png">Colored representation of the table for 0 <= n, k < 3^7</a> (where the hue is function of T(n, k))

STATUS

approved

editing

#24 by Alois P. Heinz at Fri Oct 26 09:15:39 EDT 2018

STATUS

editing

approved

#23 by Alois P. Heinz at Wed Oct 24 15:44:24 EDT 2018

EXAMPLE

0, 2, 1, 6, 8, 7, 3, 5, 4, ...

2, 1, 0, 8, 7, 6, 5, 4, 3, ...

1, 0, 2, 7, 6, 8, 4, 3, 5, ...

6, 8, 7, 3, 5, 4, 0, 2, 1, ...

8, 7, 6, 5, 4, 3, 2, 1, 0, ...

7, 6, 8, 4, 3, 5, 1, 0, 2, ...

3, 5, 4, 0, 2, 1, 6, 8, 7, ...

5, 4, 3, 2, 1, 0, 8, 7, 6, ...

4, 3, 5, 1, 0, 2, 7, 6, 8, ...

STATUS

approved

editing

#22 by Alois P. Heinz at Mon Feb 06 14:30:30 EST 2017

STATUS

editing

approved

#21 by Alois P. Heinz at Mon Feb 06 14:30:26 EST 2017

LINKS

Wikipedia, <a href="httphttps://en.wikipedia.org/wiki/Set_(game)">Set (game)</a>

STATUS

approved

editing

#20 by Alois P. Heinz at Fri Jan 09 09:44:55 EST 2015

STATUS

editing

approved

#19 by Alois P. Heinz at Fri Jan 09 09:44:51 EST 2015

CROSSREFS

A(n,floor(n/3)) gives A060587.

STATUS

approved

editing