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.

A374383 Triangle T(n, k), n > 0, k = 0..n-1, read by rows; T(n, k) is the least base b >= 2 where n and k have different sums of digits.

This page as a plain text file.
%I A374383 #6 Jul 12 2024 10:16:54
%S A374383 2,2,3,2,2,2,2,3,4,2,2,2,2,3,2,2,2,2,3,2,3,2,2,2,2,2,2,2,2,3,3,2,3,2,
%T A374383 2,2,2,2,2,5,2,3,3,2,2,2,2,2,3,2,3,4,2,2,3,2,2,2,2,2,2,2,4,2,2,2,2,2,
%U A374383 2,3,2,3,5,2,2,3,4,2,2,2,2,2,2,2,2,5,2,2,2,4,2
%N A374383 Triangle T(n, k), n > 0, k = 0..n-1, read by rows; T(n, k) is the least base b >= 2 where n and k have different sums of digits.
%F A374383 T(n, 0) = 2.
%F A374383 T(n, k) <= n+1.
%e A374383 Triangle T(n, k) begins:
%e A374383   n   n-th row
%e A374383   --  ----------------------------------
%e A374383    1  2
%e A374383    2  2, 3
%e A374383    3  2, 2, 2
%e A374383    4  2, 3, 4, 2
%e A374383    5  2, 2, 2, 3, 2
%e A374383    6  2, 2, 2, 3, 2, 3
%e A374383    7  2, 2, 2, 2, 2, 2, 2
%e A374383    8  2, 3, 3, 2, 3, 2, 2, 2
%e A374383    9  2, 2, 2, 5, 2, 3, 3, 2, 2
%e A374383   10  2, 2, 2, 3, 2, 3, 4, 2, 2, 3
%e A374383   11  2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2
%e A374383   12  2, 2, 2, 3, 2, 3, 5, 2, 2, 3, 4, 2
%t A374383 T[n_,k_]:=Module[{b=2},While[DigitSum[n,b]==DigitSum[k,b], b++]; b]; Table[T[n,k],{n,13},{k,0,n-1}]//Flatten (* _Stefano Spezia_, Jul 12 2024 *)
%o A374383 (PARI) T(n, k) = { for (b = 2, oo, my (d = sumdigits(n, b) - sumdigits(k, b)); if (d, return (b););); }
%Y A374383 Cf. A374381.
%K A374383 nonn,base,tabl
%O A374383 1,1
%A A374383 _Rémy Sigrist_, Jul 07 2024