A104181 Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).

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

Offset

1,1

Comments

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.

Links

Table of n, a(n) for n=1..29.

Mathematica

digits = 12 f[n_] = Mod[Prime[n], digits] a = Table[Binomial[Prime[digits], f[n]], {n, 1, 16*digits}]

Crossrefs

Sequence in context: A043515 A051003 A183655 * A221014 A057564 A227490

Adjacent sequences: A104178 A104179 A104180 * A104182 A104183 A104184

Keyword

nonn

Author

Roger L. Bagula, Mar 11 2005

Extensions

Edited and corrected by N. J. A. Sloane, Mar 09 2008

Status

approved