login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A142354 A triangular sequence "representation" of the modulo 10 Integer field: t(+)(n,m)=Mod[n + m, 10]; t(x)(n,m)=Mod[n*m, 10]; t(n,m)=Mod[t(=)(n,m)*t(X)(n,m),10]. 0
0, 0, 2, 0, 6, 6, 0, 2, 0, 4, 0, 0, 8, 4, 8, 0, 0, 0, 0, 0, 0, 0, 2, 6, 2, 0, 0, 2, 0, 6, 6, 0, 8, 0, 6, 6, 0, 2, 0, 4, 4, 0, 2, 0, 4, 0, 0, 8, 4, 8, 0, 0, 8, 4, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Row sums are:
{0, 2, 12, 6, 20, 0, 12, 32, 16, 40, 0}.
Modulo ten they are:
{0, 2, 2, 6, 0, 0, 2, 2, 6, 0, 0}.
The block:
{0},
{0, 2},
{0, 6, 6},
{0, 2, 0, 4},
{0, 0, 8, 4, 8},
{0, 0, 0, 0, 0, 0},
shows up in three places.
Only even {0,2,4,6,8} show up.
It may be a field representation, but can you get the
original tables back from it?
LINKS
FORMULA
t(+)(n,m)=Mod[n + m, 10]; t(x)(n,m)=Mod[n*m, 10]; t(n,m)=Mod[t(=)(n,m)*t(X)(n,m),10].
EXAMPLE
{0},
{0, 2},
{0, 6, 6},
{0, 2, 0, 4},
{0, 0, 8, 4, 8},
{0, 0, 0, 0, 0, 0},
{0, 2, 6, 2, 0, 0, 2},
{0, 6, 6, 0, 8, 0, 6, 6},
{0, 2, 0, 4, 4, 0, 2, 0, 4},
{0, 0, 8, 4, 8, 0, 0, 8, 4, 8},
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}
MATHEMATICA
Clear[t1, t2, t, n, m, a]; t1[n_, m_] = Mod[n + m, 10]; t2[n_, m_] = Mod[n*m, 10]; t[n_, m_] = Mod[t1[n, m]*t2[n, m], 10]; a = Table[Table[t[n, m], {m, 0, n}], {n, 0, 10}]
CROSSREFS
Sequence in context: A145419 A276763 A338465 * A105110 A351884 A342501
KEYWORD
nonn,uned
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 06:24 EDT 2024. Contains 371918 sequences. (Running on oeis4.)