Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A106730
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A106730
%S A106730 2,3,0,1,3,0,1,2,4,0,1,0,1,3,4,2,3,0,1,4,4,2,3,0,1,3,0,1,2,4,4,4,0,1,4,
%T A106730 2,2,0,1,2,2,4,4,0,1,0,1,4,4,0,1,0,1,3,4,2,3,0,1,0,1,4,2,3,3,3,2,2,0,1,
%U A106730 4,4,3,2,4,0,1,3,4,0,1,3,0,1,0,1,4,2,0,1,2,0,1,3,4,3,4,2,4,3,2,3,3,3,0
%N A106730 Product-based sequence of a Markov type based on a functional addition 
               group.
%C A106730 The object of this sequence is to show a product Markov can be formed 
               from an Addition group based on the primes. Modulo five can be taken 
               as a signed modulo three: {0,1,2,3,4}->{-2,-1,0,-1,-2}
%F A106730 f(n)=10-Mod[Prime[n+3], 10] g[n]=Mod[Mod[n, 5], 4] h(n)]=g(f(n)) a(n)=Mod[Mod[(1+h[n))*a(n-1), 
               5]+1, 5]
%t A106730 f[n_] = 10 - Mod[Prime[n + 3], 10] g[n_] = Mod[Mod[n, 5], 4] h[n_] = 
               g[f[n]] digits = 20 aa[1] = 2; aa[n_] := aa[n] = Mod[Mod[aa[n - 1]*(1 
               + h[n]), 5] + 1, 5] c = Table[aa[n], {n, 1, digits^2/2}]
%Y A106730 Sequence in context: A049263 A014588 A053645 this_sequence A089652 A112168 
               A072516
%Y A106730 Adjacent sequences: A106727 A106728 A106729 this_sequence A106731 A106732 
               A106733
%K A106730 nonn,uned
%O A106730 0,1
%A A106730 Roger L. Bagula (rlbagulatftn(AT)yahoo.com), May 14 2005

    
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research