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.

A360964 Triangle T(n, k), n > 0, k = 0..n-1, read by rows: T(n, k) is the least base b >= 2 where the number of digits of n and k are different.

This page as a plain text file.
%I A360964 #10 Mar 01 2023 02:09:06
%S A360964 2,2,2,2,2,3,2,2,2,2,2,2,2,2,5,2,2,2,2,5,6,2,2,2,2,5,6,7,2,2,2,2,2,2,
%T A360964 2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,3,10,2,2,2,2,2,2,2,2,3,10,11,2,
%U A360964 2,2,2,2,2,2,2,3,10,11,12,2,2,2,2,2,2,2,2,3,10,11,12,13
%N A360964 Triangle T(n, k), n > 0, k = 0..n-1, read by rows: T(n, k) is the least base b >= 2 where the number of digits of n and k are different.
%C A360964 Leading zeros are ignored (and 0 is assumed to have length 0).
%H A360964 Rémy Sigrist, <a href="/A360964/b360964.txt">Table of n, a(n) for n = 1..10011</a>
%H A360964 Rémy Sigrist, <a href="/A360964/a360964.png">Colored representation of the first 512 rows</a>
%F A360964 T(n, 0) = 2.
%F A360964 T(n, n-1) = A052410(n) for any n > 1.
%e A360964 Triangle T(n, k) begins:
%e A360964   n\k | 0  1  2  3  4  5  6  7  8   9  10  11
%e A360964   ----+--------------------------------------
%e A360964     1 | 2
%e A360964     2 | 2  2
%e A360964     3 | 2  2  3
%e A360964     4 | 2  2  2  2
%e A360964     5 | 2  2  2  2  5
%e A360964     6 | 2  2  2  2  5  6
%e A360964     7 | 2  2  2  2  5  6  7
%e A360964     8 | 2  2  2  2  2  2  2  2
%e A360964     9 | 2  2  2  2  2  2  2  2  3
%e A360964    10 | 2  2  2  2  2  2  2  2  3  10
%e A360964    11 | 2  2  2  2  2  2  2  2  3  10  11
%e A360964    12 | 2  2  2  2  2  2  2  2  3  10  11  12
%o A360964 (PARI) T(n,k) = { for (b=2, oo, if (#digits(n,b) != #digits(k,b), return (b))) }
%Y A360964 Cf. A052410, A360963.
%K A360964 nonn,base,tabl
%O A360964 1,1
%A A360964 _Rémy Sigrist_, Feb 27 2023