|
Search: id:A106728
|
|
|
| A106728 |
|
Triangular array based on modulo ten addition of the primes under a modulo five, modulo four function. |
|
+0
1
|
|
| 2, 3, 0, 1, 2, 0, 2, 3, 1, 2, 0, 1, 3, 0, 2, 1, 2, 0, 1, 3, 0, 0, 1, 3, 0, 2, 3, 2, 3, 0, 2, 3, 1, 2, 1, 0, 2, 3, 1, 2, 0, 1, 0, 3, 2, 3, 0, 2, 3, 1, 2, 1, 0, 3, 0, 1, 2, 0, 1, 3, 0, 3, 2, 1, 2, 0, 2, 3, 1, 2, 0, 1, 0, 3, 2, 3, 1, 2, 1, 2, 0, 1, 3, 0, 3, 2, 1, 2, 0, 1, 0, 0, 1, 3, 0, 2, 3, 2, 1, 0, 1, 3, 0, 3, 2
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
The obect of these modulo functions is form a group under Addition. Triangular form: {2} {3, 0} {1, 2, 0} {2, 3, 1, 2} {0, 1, 3, 0, 2} {1, 2, 0, 1, 3, 0} {0, 1, 3, 0, 2, 3, 2} These can be translated back to modulo 10 by using the substitution: 0->9 1->1 2->7 3->3
|
|
FORMULA
|
f(n)=10-Mod[Prime[n+3], 10] g[n]=Mod[Mod[n, 5], 4] h(n)]=g(f(n)) a[n, m)=Mod[h[n)+h(m), 4]
|
|
MATHEMATICA
|
f[n_] = 10 - Mod[Prime[n + 3], 10] g[n_] = Mod[Mod[n, 5], 4] h[n_] = g[f[n]] digits = 20 a = Table[Table[Mod[h[n]+h[m], 4], {n, 1, m}], {m, 1, digits}]; MatrixForm[a] Flatten[a]
|
|
CROSSREFS
|
Sequence in context: A103498 A030386 A096799 this_sequence A010873 A049804 A132387
Adjacent sequences: A106725 A106726 A106727 this_sequence A106729 A106730 A106731
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), May 14 2005
|
|
|
Search completed in 0.002 seconds
|
