The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A274916 Triangle T(n, k) read by rows: sum of residues p^(q-1) (mod q^2) and q^(p-1) (mod p^2), where p = prime(n) and q = prime(k) for k = 1, 2, ...., n-1. 1
 7, 17, 13, 18, 47, 44, 59, 5, 94, 38, 41, 112, 25, 133, 242, 223, 172, 226, 74, 188, 204, 61, 344, 250, 249, 128, 344, 317, 395, 399, 339, 306, 262, 347, 398, 412, 31, 440, 355, 835, 757, 737, 300, 713, 772, 190, 535, 301, 808, 137, 1013, 738, 647, 730, 1119 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS T(n, k) = 2 iff (p, q) is a double Wieferich prime pair. Triangle starts     7;    17,  13;    18,  47,  44;    59,   5,  94,  38;    41, 112,  25, 133, 242;   223, 172, 226,  74, 188,  204;    61, 344, 250, 249, 128,  344, 317;   395, 399, 339, 306, 262,  347, 398, 412;    31, 440, 355, 835, 757,  737, 300, 713, 772;   190, 535, 301, 808, 137, 1013, 738, 647, 730, 1119; LINKS Wikipedia, Wieferich pair EXAMPLE For n = 652 and k = 23: prime(23) = 83 and prime(652) = 4871. 83 and 4871 form a double Wieferich prime pair, so 83^4870 (mod 4871^2) = 1 and 4871^82 (mod 83^2) = 1, hence T(652, 23) = 1+1 = 2. PROG (PARI) t(n, k) = lift(Mod(prime(n), prime(k)^2)^(prime(k)-1)) + lift(Mod(prime(k), prime(n)^2)^(prime(n)-1)) trianglerows(n) = for(x=2, n+1, for(y=1, x-1, print1(t(x, y), ", ")); print("")) trianglerows(6) \\ print upper 6 rows of triangle CROSSREFS Cf. A124121, A124122, A126432, A266829. Sequence in context: A156680 A107804 A276809 * A128713 A283163 A196164 Adjacent sequences:  A274913 A274914 A274915 * A274917 A274918 A274919 KEYWORD nonn,tabl AUTHOR Felix FrÃ¶hlich, Dec 11 2016 STATUS approved

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

Last modified April 7 19:49 EDT 2020. Contains 333306 sequences. (Running on oeis4.)