|
Search: id:A104181
|
|
|
| A104181 |
|
Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)). |
|
+0
2
|
|
| 666, 7770, 435897, 10295472, 854992152, 37, 435897, 10295472, 854992152, 435897, 10295472, 37, 435897, 10295472, 854992152, 435897, 854992152, 37, 10295472, 854992152, 37, 10295472, 854992152, 435897, 37, 435897, 10295472, 854992152, 37
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
A type of cycling model for sequence based on the Mealy model for sequential machines: the function f is the memory element as a mapping and the binomial is the combinatorial part. It is called a Meally machine. Other mapping functions can be used in this general model for an n-symbol cycle.
|
|
REFERENCES
|
Taylor L. Booth, Sequential Machines and Automata Theory, John Wiley and Sons, Inc, 1967, see page 70.
|
|
MATHEMATICA
|
digits = 12 f[n_] = Mod[Prime[n], digits] a = Table[Binomial[Prime[digits], f[n]], {n, 1, 16*digits}]
|
|
CROSSREFS
|
Sequence in context: A062045 A043515 A051003 this_sequence A057564 A046694 A138563
Adjacent sequences: A104178 A104179 A104180 this_sequence A104182 A104183 A104184
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
R. L. Bagula (rlbagulatftn(AT)yahoo.com), Mar 11 2005
|
|
EXTENSIONS
|
Edited and corrected by N. J. A. Sloane (njas(AT)research.att.com), Mar 09 2008
|
|
|
Search completed in 0.002 seconds
|
