Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Mar 30 2012 18:50:38
%S 3,4,2,3,2,2,7,8,2,2,7,4,5,0,2,10,3,5,4,0,2,3,7,2,0,0,0,2,13,2,6,0,7,
%T 7,3,2,13,4,6,2,0,3,3,0,2,17,10,8,5,4,3,0,4,4,2,9,7,5,7,1,4,3,2,3
%N Triangular array read by rows, 2<=k<=n: T(n,k) = smallest number that in base k representation is not contained in n^n.
%C T(n,n) = 2 for n>2.
%e Initial values of n^n in representations with increasing base:
%e 2^2: ........................... 100
%e 3^3: ....................... 11011 1000
%e 4^4: ................. 100000000 100111 10000
%e 5^5: ......... 110000110101 11021202 300311 100000
%e 6^6: 1011011001000000 2101000000 23121000 2443111 1000000
%e '11021202' = ternary 5^5: all ternary numbers < 8 are contained
%e in '11021202': '0', '1', '2', '10', '11', '12', '20' and '21', but not
%e 8='22', therefore T(5,3)=8.
%Y Cf. A088876, A000312.
%K nonn,tabl,base
%O 2,1
%A _Reinhard Zumkeller_, Nov 28 2003