Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A106728
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A106728
%S A106728 2,3,0,1,2,0,2,3,1,2,0,1,3,0,2,1,2,0,1,3,0,0,1,3,0,2,3,2,3,0,2,3,1,2,1,
%T A106728 0,2,3,1,2,0,1,0,3,2,3,0,2,3,1,2,1,0,3,0,1,2,0,1,3,0,3,2,1,2,0,2,3,1,2,
%U A106728 0,1,0,3,2,3,1,2,1,2,0,1,3,0,3,2,1,2,0,1,0,0,1,3,0,2,3,2,1,0,1,3,0,3,2
%N A106728 Triangular array based on modulo ten addition of the primes under a modulo 
               five, modulo four function.
%C A106728 The obect of these modulo functions is form a group under Addition. Triangular 
               form: {2} {3, 0} {1, 2, 0} {2, 3, 1, 2} {0, 1, 3, 0, 2} {1, 2, 0, 
               1, 3, 0} {0, 1, 3, 0, 2, 3, 2} These can be translated back to modulo 
               10 by using the substitution: 0->9 1->1 2->7 3->3
%F A106728 f(n)=10-Mod[Prime[n+3], 10] g[n]=Mod[Mod[n, 5], 4] h(n)]=g(f(n)) a[n, 
               m)=Mod[h[n)+h(m), 4]
%t A106728 f[n_] = 10 - Mod[Prime[n + 3], 10] g[n_] = Mod[Mod[n, 5], 4] h[n_] = 
               g[f[n]] digits = 20 a = Table[Table[Mod[h[n]+h[m], 4], {n, 1, m}], 
               {m, 1, digits}]; MatrixForm[a] Flatten[a]
%Y A106728 Sequence in context: A103498 A030386 A096799 this_sequence A010873 A049804 
               A132387
%Y A106728 Adjacent sequences: A106725 A106726 A106727 this_sequence A106729 A106730 
               A106731
%K A106728 nonn,uned
%O A106728 0,1
%A A106728 Roger L. Bagula (rlbagulatftn(AT)yahoo.com), May 14 2005

    
page 1

Search completed in 0.002 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 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research