cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A094265 Largest number in n-th row of triangle A094263.

Original entry on oeis.org

0, 0, 1, 1, 2, 1, 2, 4, 4, 4, 8, 5, 9, 8, 9, 6, 9, 12, 11, 10, 10, 16, 11, 16, 12, 20, 10, 18, 26, 20, 25, 26, 23, 24, 26, 27, 31, 28, 25, 28, 26, 30, 25, 36, 25, 31, 37, 36, 25, 35, 36, 37, 49, 36, 48, 48, 49, 48, 44, 45, 41, 48, 49, 40, 56, 45, 49, 64, 49, 45, 53, 60, 64, 64, 65
Offset: 1

Views

Author

Amarnath Murthy, Apr 26 2004

Keywords

Crossrefs

Cf. A094263.

Extensions

Edited and extended by David Wasserman, Jan 24 2007

A094264 a(n) = Sum_{r = 1..n} (n^r mod r).

Original entry on oeis.org

0, 0, 1, 1, 4, 1, 6, 10, 12, 9, 20, 12, 27, 32, 28, 32, 57, 38, 50, 67, 65, 82, 75, 76, 84, 147, 101, 143, 151, 117, 157, 208, 205, 210, 204, 199, 231, 309, 274, 239, 236, 275, 257, 430, 336, 364, 367, 459, 322, 484, 480, 551, 465, 547, 556, 682, 616, 733, 592, 555, 493, 774
Offset: 1

Views

Author

Amarnath Murthy, Apr 26 2004

Keywords

Crossrefs

Programs

  • Maple
    f:= proc(n) local r; add(n &^ r mod r, r=1..n) end proc:
    map(f, [$1..100]); # Robert Israel, Apr 17 2023
  • Mathematica
    Do[Print[Sum[Mod[n^r, r], {r, 1, n}]], {n, 1, 30}] (* Ryan Propper, Jul 10 2005 *)

Extensions

More terms from Ryan Propper, Jul 10 2005

A114448 Array a(n,k) = n^k (mod k) read by antidiagonals (k>=1, n>=1).

Original entry on oeis.org

0, 0, 1, 0, 0, 1, 0, 1, 2, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 2, 1, 0, 0, 2, 0, 3, 4, 1, 0, 1, 0, 1, 4, 3, 2, 1, 0, 0, 1, 0, 0, 4, 3, 0, 1, 0, 1, 2, 1, 1, 1, 4, 1, 8, 1, 0, 0, 0, 0, 2, 0, 5, 0, 0, 4, 1, 0, 1, 1, 1, 3, 1, 6, 1, 1, 9, 2, 1, 0, 0, 2, 0, 4, 4, 0, 0, 8, 6, 3, 4, 1, 0, 1, 0, 1, 0, 3, 1, 1, 0, 5, 4, 9, 2, 1
Offset: 1

Views

Author

Leroy Quet, Feb 14 2006

Keywords

Comments

Alternate description: triangular array a(n, k) = n^k (mod k) read by rows (n > 1, 0 < k < n). This is equivalent because a(n, k) = a(n-k, k). - David Wasserman, Jan 25 2007

Examples

			2^6 = 64 and 64 (mod 6) is 4. So a(2,6) = 4.
		

Crossrefs

Programs

  • Mathematica
    a[n_, k_] := Mod[n^k, k]; Table[a[n - k + 1, k], {n, 1, 14}, {k, 1, n}] // Flatten (* Jean-François Alcover, Dec 12 2012 *)

Extensions

More terms from David Wasserman, Jan 25 2007
Showing 1-3 of 3 results.