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.

A281383 Triangle read by rows T(n,k) is the least integer with more than 1 digit in base n and k, such that the set of its base_n digits equals the set of its base_k digits.

This page as a plain text file.
%I A281383 #5 Jan 21 2017 09:22:37
%S A281383 2,9,3,4,22,4,5,7,28,5,6,36,55,46,6,49,51,9,17,68,7,8,17,64,91,708,94,
%T A281383 8,9,9,81,11,212,31,124,9,10,10,13,213,331,23,614,158,10,11,23,124,
%U A281383 385,13,38,145,49,196,11,12,12,25,49,289,61,475,2035,1880,238,12
%N A281383 Triangle read by rows T(n,k) is the least integer with more than 1 digit in base n and k, such that the set of its base_n digits equals the set of its base_k digits.
%F A281383 T(n, n) = n.
%e A281383 Triangle starts:
%e A281383 2;
%e A281383 9, 3;
%e A281383 4, 22, 4;
%e A281383 5, 7, 28, 5;
%e A281383 6, 36, 55, 46, 6;
%e A281383 49, 51, 9, 17, 68, 7;
%e A281383 8, 17, 64, 91, 708, 94, 8;
%e A281383 ...
%o A281383 (PARI) T(n, k) = my(m=min(n,k)); while (Set(digits(m, n)) != Set(digits(m,k)), m++); m;
%o A281383 tabl(nn) = {for (n=2, nn, for (k=2, n, print1(T(n,k), ", ");); print(););}
%Y A281383 Cf. A033170, A037408-A037443.
%Y A281383 Cf. A281384 (first column).
%K A281383 nonn,base,tabl
%O A281383 2,1
%A A281383 _Michel Marcus_, Jan 21 2017