The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A049767

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A049767

Triangular array T, read by rows: T(n,k) = (k^2 mod n) + (n^2 mod k), for k = 1..n and n >= 1.
(history; published version)

#21 by Charles R Greathouse IV at Thu Sep 08 08:44:58 EDT 2022

PROG

(MAGMAMagma) [[Modexp(k, 2, n) + Modexp(n, 2, k): k in [1..n]]: n in [1..15]]; // G. C. Greubel, Dec 13 2019

Discussion

Thu Sep 08

08:44

OEIS Server: https://oeis.org/edit/global/2944

#20 by Joerg Arndt at Sat Dec 14 08:13:39 EST 2019

STATUS

reviewed

approved

#19 by Michel Marcus at Sat Dec 14 03:04:44 EST 2019

STATUS

proposed

reviewed

#18 by Jon E. Schoenfield at Fri Dec 13 21:34:38 EST 2019

STATUS

editing

proposed

#17 by Jon E. Schoenfield at Fri Dec 13 21:34:36 EST 2019

NAME

Triangular array T, read by rows: T(n,k) = (k^2 mod n) + (n^2 mod k), for k = 1..n and n >= 1.

EXAMPLE

1, 0;

1, 2, 0;

1, 0, 2, 0;

1, 5, 5, 2, 0;

1, 4, 3, 4, 2, 0;

1, 5, 3, 3, 8, 2, 0;

1, 4, 2, 0, 5, 8, 2, 0;

1, 5, 0, 8, 8, 3, 8, 2, 0;

1, 4, 10, 6, 5, 10, 11, 8, 2, 0;

STATUS

proposed

editing

#16 by G. C. Greubel at Fri Dec 13 16:39:25 EST 2019

STATUS

editing

proposed

#15 by G. C. Greubel at Fri Dec 13 16:39:20 EST 2019

LINKS

G. C. Greubel, <a href="/A049767/b049767.txt">Rows n = 1..100 of triangle, flattened</a>

MAPLE

seq(seq( `mod`(k^2, n) + `mod`(n^2, k), k = 1..n), n = 1..15); # G. C. Greubel, Dec 13 2019

MATHEMATICA

Table[PowerMod[k, 2, n] + PowerMod[n, 2, k], {n, 15}, {k, n}]//Flatten (* G. C. Greubel, Dec 13 2019 *)

PROG

(PARI) T(n, k) = lift(Mod(k, n)^2) + lift(Mod(n, k)^2);

for(n=1, 15, for(k=1, n, print1(T(n, k), ", "))) \\ G. C. Greubel, Dec 13 2019

(MAGMA) [[Modexp(k, 2, n) + Modexp(n, 2, k): k in [1..n]]: n in [1..15]]; // G. C. Greubel, Dec 13 2019

(Sage) [[power_mod(k, 2, n) + power_mod(n, 2, k) for k in (1..n)] for n in (1..15)] # G. C. Greubel, Dec 13 2019

(GAP) Flat(List([1..15], n-> List([1..n], k-> PowerMod(k, 2, n) + PowerMod(n, 2, k) ))); # G. C. Greubel, Dec 13 2019

STATUS

approved

editing

#14 by Bruno Berselli at Thu Nov 21 04:07:14 EST 2019

STATUS

proposed

approved

#13 by Michel Marcus at Thu Nov 21 00:58:45 EST 2019

STATUS

editing

proposed

Discussion

Thu Nov 21

01:06

Petros Hadjicostas: Yes, correct! I just checked that!

#12 by Michel Marcus at Thu Nov 21 00:58:29 EST 2019

FORMULA

T(n, k) = A048152(n, k) + A049759(n, k). - Michel Marcus, Nov 21 2019

CROSSREFS

Cf. A048152, A049759.

STATUS

proposed

editing

Discussion

Thu Nov 21

00:58

Michel Marcus: right ?