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.

A362366 Square array A(n, k), n, k >= 0, read by antidiagonals; A(n, k) is the least base >= 2 where the sum n + k can be computed without carry.

Original entry on oeis.org

2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 3, 5, 3, 2, 2, 2, 3, 3, 2, 2, 2, 4, 2, 3, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 5, 5, 4, 4, 5, 5, 2, 2, 2, 3, 2, 6, 4, 4, 4, 6, 2, 3, 2, 2, 2, 2, 2, 4, 4, 4, 4, 2, 2, 2, 2, 2, 5, 5, 3, 2, 5, 5, 5, 2, 3, 5, 5, 2
Offset: 0

Views

Author

Rémy Sigrist, Apr 17 2023

Keywords

Examples

			Array A(n, k) begins:
  n\k | 0  1  2  3  4  5  6  7  8  9  10  11  12
  ----+-----------------------------------------
    0 | 2  2  2  2  2  2  2  2  2  2   2   2   2
    1 | 2  3  2  3  2  4  2  3  2  3   2   5   2
    2 | 2  2  5  3  2  2  3  5  2  2   5   5   2
    3 | 2  3  3  3  2  3  5  6  2  3   3   3   2
    4 | 2  2  2  2  3  4  4  4  2  2   2   2   3
    5 | 2  4  2  3  4  4  4  5  2  3   2   5   3
    6 | 2  2  3  5  4  4  5  5  2  2   3   3   5
    7 | 2  3  5  6  4  5  5  5  2  3   3   5   5
    8 | 2  2  2  2  2  2  2  2  6  3   5   5   6
    9 | 2  3  2  3  2  3  2  3  3  3   3   3   3
   10 | 2  2  5  3  2  2  3  3  5  3   3   5   3
   11 | 2  5  5  3  2  5  3  5  5  3   5   5   3
   12 | 2  2  2  2  3  3  5  5  6  3   3   3   3
		

Crossrefs

Programs

  • PARI
    A(n, k) = { for (b = 2, oo, if (sumdigits(n+k, b) == sumdigits(n, b) + sumdigits(k, b), return (b););); }

Formula

A(n, k) <= max(2, n + k + 1).
A(n, k) = A(k, n).
A(n, 0) = 2.
A(n, n) = A321882(n).