Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #8 Mar 31 2012 20:35:48
%S 666,7770,435897,10295472,854992152,37,435897,10295472,854992152,
%T 435897,10295472,37,435897,10295472,854992152,435897,854992152,37,
%U 10295472,854992152,37,10295472,854992152,435897,37,435897,10295472,854992152,37
%N Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).
%C 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.
%D Taylor L. Booth, Sequential Machines and Automata Theory, John Wiley and Sons, Inc, 1967, see page 70.
%t digits = 12 f[n_] = Mod[Prime[n], digits] a = Table[Binomial[Prime[digits], f[n]], {n, 1, 16*digits}]
%K nonn
%O 1,1
%A _Roger L. Bagula_, Mar 11 2005
%E Edited and corrected by _N. J. A. Sloane_, Mar 09 2008