|
Search: id:A105244
|
|
|
| A105244 |
|
Functional substitution on {1,2,3}. |
|
+0
1
|
|
| 1, 2, 3, 3, 1, 1, 2, 2, 1, 1, 1, 1, 3, 2, 1, 2, 1, 1, 1, 2, 1, 3, 1, 1, 2, 2, 1, 1, 1, 1, 3, 2, 1, 2, 1, 1, 1, 2, 1, 3, 1, 1, 2, 2, 1, 1, 1, 1, 3, 2, 1, 2, 1, 1, 1, 2, 1, 3, 1, 1, 2, 2, 1, 1, 1, 1, 3, 2, 1, 2, 1, 1, 1, 2, 1, 3, 1, 1, 2, 2, 1, 1, 1, 1, 3, 2, 1, 2, 1, 1, 1, 2, 1, 3, 1, 1, 2, 2, 1, 1, 1, 1, 3, 2, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Based on a prime digits function modulo 10, reduced here to modulo 3.
|
|
FORMULA
|
ar={1, 2, 3} a(n)=b(m, i) = 1 + Mod[ar[[i]]*(1 + Mod[m, 3]), 3]
|
|
MATHEMATICA
|
ar = {1, 2, 3} f[n_] := 1 + Mod[ar*(1 + Mod[n, 3]), 3] br = NestList[f, ar, Floor[200/3]] a = Flatten[br]
|
|
CROSSREFS
|
Sequence in context: A124798 A005135 A139460 this_sequence A145854 A097663 A066517
Adjacent sequences: A105241 A105242 A105243 this_sequence A105245 A105246 A105247
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
Roger Bagula (rlbagulatftn(AT)yahoo.com), Apr 12 2005
|
|
|
Search completed in 0.002 seconds
|
