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!)
A166865 Triangle read by rows: R(n,k)=prime(k)^(prime(n)-2) mod n, 1<=k<=n. 0

%I #11 Mar 30 2012 18:52:34

%S 0,0,1,2,0,2,0,3,1,3,2,3,0,2,1,2,3,5,1,5,1,1,6,6,0,1,6,6,0,3,5,7,3,5,

%T 1,3,8,0,8,1,8,1,8,1,8,8,7,5,3,1,7,3,9,7,9,6,4,9,8,0,6,2,7,1,8,5,8,3,

%U 5,7,11,1,5,7,11,5,7,1

%N Triangle read by rows: R(n,k)=prime(k)^(prime(n)-2) mod n, 1<=k<=n.

%C Row sums: 0, 1, 4, 7, 8, 17, 26, 27, 43, 59, 56, 71, …, .

%e Triangle begins:

%e 0,

%e 0, 1,

%e 2, 0, 2,

%e 0, 3, 1, 3,

%e 2, 3, 0, 2, 1,

%e 2, 3, 5, 1, 5, 1,

%t t[n_, k_] := Mod[Prime@ k^(Prime@ n - 2), n]; Table[ t[n, k], {n, 12}, {k, n}] // Flatten

%Y Cf. A000079, A177226.

%K nonn,tabl

%O 1,4

%A _Juri-Stepan Gerasimov_, Dec 16 2010

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 May 11 06:26 EDT 2024. Contains 372388 sequences. (Running on oeis4.)