|
Search: id:A072845
|
|
|
| A072845 |
|
{1, 3, 7, 9} -> Mod[ {1*{1, 3, 7, 9}, 3*{1, 3, 7, 9}, 7*{1, 3, 7, 9}, 9*{1, 3, 7, 9}}, 10} |
|
+0
4
|
|
| 1, 3, 7, 9, 1, 3, 7, 9, 3, 9, 1, 7, 7, 1, 9, 3, 9, 7, 3, 1, 1, 3, 7, 9, 3, 9, 1, 7, 7, 1, 9, 3, 9, 7, 3, 1, 3, 9, 1, 7, 9, 7, 3, 1, 1, 3, 7, 9, 7, 1, 9, 3, 7, 1, 9, 3, 1, 3, 7, 9, 9, 7, 3, 1, 3, 9, 1, 7, 9, 7, 3, 1, 7, 1, 9, 3, 3, 9, 1, 7, 1, 3, 7, 9, 1, 3, 7, 9, 3, 9, 1, 7, 7, 1, 9, 3, 9, 7, 3, 1, 3, 9, 1, 7, 9
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
A matrix self-similar process as applied to the array {1,3,7,9} modulo 10.
This produces a pseudorational sequence that has the property of also being self-similar. This is actually a general kind of sequence for an integer array of any length. The magic square properties of the array used make the result special and separable into binary four arrays. As a sum of negative powers of ten this also produces a pseudorational type number.
These arrays are related to Hadamard-Sylvester matrices and it was the behavior of majoc squares in matrix self-similarity that actually gave me the idea. Herbert Franke has done some work on these kind of arrays as well which was published in TFTN in 1998.
|
|
MATHEMATICA
|
ar={1, 3, 7, 9}; f[x_]=Mod[ar*x, 10]; br=Flatten[ NestList[f, ar, 3]]
|
|
CROSSREFS
|
Sequence in context: A101366 A090458 A131712 this_sequence A021729 A071641 A093336
Adjacent sequences: A072842 A072843 A072844 this_sequence A072846 A072847 A072848
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jul 24 2002
|
|
EXTENSIONS
|
Edited by Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 27 2002
|
|
|
Search completed in 0.002 seconds
|
