|
Search: id:A118683
|
|
|
| A118683 |
|
A triangular function based on the modulo 3 last digit multiplication behavior of the primes. |
|
+0
1
|
|
| 0, 2, 0, 0, 2, 0, 1, 1, 1, 1, 0, 2, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 2, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 2, 0, 1, 0, 1, 0, 1, 0, 0, 2, 0, 1, 0, 1, 0, 1, 0, 0
(list; table; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
This function has the structure of a entropic fuzzy logic "or" function
|
|
FORMULA
|
a(n,m) = Mod[Prime[n], 3] + Mod[Prime[m], 3] - Mod[Prime[n], 3]*Mod[Prime[m], 3]
|
|
EXAMPLE
|
0
2, 0
0, 2, 0
1, 1, 1, 1
0, 2, 0, 1, 0
1, 1, 1, 1, 1, 1
0, 2, 0, 1, 0, 1, 0
1, 1, 1, 1, 1, 1, 1, 1
0, 2, 0, 1, 0, 1, 0, 1, 0
0, 2, 0, 1, 0, 1, 0, 1, 0, 0
|
|
MATHEMATICA
|
f[n_, m_]Mod[Prime[n], 3] + Mod[Prime[m], 3] - Mod[Prime[n], 3]*Mod[Prime[m], 3] a = Table[Table[f[n, m], {n, 1, m}], {m, 1, 10}] aout = Flatten[a]
|
|
CROSSREFS
|
Sequence in context: A061897 A047919 A101670 this_sequence A112605 A111775 A025844
Adjacent sequences: A118680 A118681 A118682 this_sequence A118684 A118685 A118686
|
|
KEYWORD
|
nonn,tabl,uned
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), May 19 2006
|
|
|
Search completed in 0.002 seconds
|
