|
| |
|
|
A004489
|
|
Table of tersums m + n (answers written in base 10).
|
|
3
| |
|
|
0, 1, 1, 2, 2, 2, 3, 0, 0, 3, 4, 4, 1, 4, 4, 5, 5, 5, 5, 5, 5, 6, 3, 3, 6, 3, 3, 6, 7, 7, 4, 7, 7, 4, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 6, 6, 0, 6, 6, 0, 6, 6, 9, 10, 10, 7, 1, 1, 7, 1, 1, 7, 10, 10, 11, 11, 11, 2, 2, 2, 2, 2, 2, 11, 11, 11, 12, 9, 9, 12, 0, 0, 3, 0, 0, 12, 9, 9, 12, 13, 13, 10, 13
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,4
|
|
|
LINKS
| Alois P. Heinz, Diagonals d = 0..140, flattened
|
|
|
FORMULA
| Tersum m + n: write m and n in base 3 and add mod 3 with no carries, e.g. 5 + 8 = "21" + "22" = "10" = 1.
|
|
|
MAPLE
| T:= proc(n, m) local t, h, r, i;
t, h, r:= n, m, 0;
for i from 0 while t>0 or h>0 do
r:= r +3^i *irem (irem (t, 3, 't') +irem (h, 3, 'h'), 3)
od; r
end:
seq (seq (T (n, d-n), n=0..d), d=0..12); # Alois P. Heinz, Sep 07 2011
|
|
|
CROSSREFS
| Similar to but different from A004481.
Sequence in context: A084957 A035307 A004481 * A112599 A106795 A162203
Adjacent sequences: A004486 A004487 A004488 * A004490 A004491 A004492
|
|
|
KEYWORD
| nonn,tabl,easy,nice
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| More terms from Larry Reeves (larryr(AT)acm.org), Jan 23 2001
|
| |
|
|
