|
Search: id:A106727
|
|
|
| A106727 |
|
Triangular array based on modulo ten products of the primes. |
|
+0
1
|
|
| 9, 7, 1, 1, 3, 9, 9, 7, 1, 9, 3, 9, 7, 3, 1, 1, 3, 9, 1, 7, 9, 3, 9, 7, 3, 1, 7, 1, 7, 1, 3, 7, 9, 3, 9, 1, 9, 7, 1, 9, 3, 1, 3, 7, 9, 7, 1, 3, 7, 9, 3, 9, 1, 7, 1, 1, 3, 9, 1, 7, 9, 7, 3, 1, 3, 9, 9, 7, 1, 9, 3, 1, 3, 7, 9, 7, 1, 9, 1, 3, 9, 1, 7, 9, 7, 3, 1, 3, 9, 1, 9, 3, 9, 7, 3, 1, 7, 1, 9, 3, 9, 7, 3, 7, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
The modulo ten functions here form a group under multiplication. Triangular form: {9} {7, 1} {1, 3, 9} {9, 7, 1, 9} {3, 9, 7, 3, 1} {1, 3, 9, 1, 7, 9} {3, 9, 7, 3, 1, 7, 1}
|
|
FORMULA
|
f(n)=10-Mod[Prime[n+3], 10] a[n, m)=Mod[f[n)*f(m), 10]
|
|
MATHEMATICA
|
f[n_] = 10 - Mod[Prime[n + 3], 10] digits = 20 a = Table[Table[Mod[f[n]*f[m], 10], {n, 1, m}], {m, 1, digits}]; MatrixForm[a] Flatten[a]
|
|
CROSSREFS
|
Sequence in context: A145422 A021107 A155691 this_sequence A094134 A154396 A069611
Adjacent sequences: A106724 A106725 A106726 this_sequence A106728 A106729 A106730
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), May 14 2005
|
|
|
Search completed in 0.002 seconds
|
