login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A120456 Antidiagonal triangular version of the modulo 15 prime multiplication table past n=3. 0

%I #9 Mar 12 2014 16:36:52

%S 1,2,2,4,4,4,7,8,8,7,8,14,1,14,8,11,1,13,13,1,11,13,7,2,4,2,7,13,14,

%T 11,14,11,11,14,11,14

%N Antidiagonal triangular version of the modulo 15 prime multiplication table past n=3.

%C This modulo 15 of prime digit endings is important because it gives even odd prime types that appear in pairs: {1,4},{2,13},{7,8},{11,14}

%F b[n]={1, 2, 4, 7, 8, 11, 13, 14} T[n,m]=Mod[b[n]*b[m],15] a(n) = T[n,m]: antidiagonal form

%e Array looks like:

%e 1, 2, 4, 7, 8, 11, 13, 14

%e 2, 4, 8, 14, 1, 7, 11, 13

%e 4, 8, 1, 13, 2, 14, 7, 11

%e 7, 14, 13, 4, 11, 2, 1, 8

%e 8, 1, 2, 11, 4, 13, 14, 7

%e 11, 7, 14, 2, 13, 1, 8, 4

%e 13, 11, 7, 1, 14, 8, 4, 2

%e 14, 13, 11, 8, 7, 4, 2, 1

%t Table[Mod[Prime[n], 15], {n, 1, 50}] a = {1, 2, 4, 7, 8, 11, 13, 14} b = Table[Mod[a[[n]]*a[[m]], 15], {n, 1, 8}, {m, 1, 8}] c = Table[Table[b[[n, l - n]], {n, 1, l - 1}], {l, 1, Dimensions[b][[1]] + 1}] Flatten[c]

%K nonn,tabf,fini

%O 0,2

%A _Roger L. Bagula_, Jun 23 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 14:38 EDT 2024. Contains 371254 sequences. (Running on oeis4.)