The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A088916 Triangular array read by rows, 2<=k<=n: T(n,k) = smallest number that in base k representation is not contained in n^n. 0
 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, 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 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 COMMENTS T(n,n) = 2 for n>2. LINKS EXAMPLE Initial values of n^n in representations with increasing base: 2^2: ........................... 100 3^3: ....................... 11011 1000 4^4: ................. 100000000 100111 10000 5^5: ......... 110000110101 11021202 300311 100000 6^6: 1011011001000000 2101000000 23121000 2443111 1000000 '11021202' = ternary 5^5: all ternary numbers < 8 are contained in '11021202': '0', '1', '2', '10', '11', '12', '20' and '21', but not 8='22', therefore T(5,3)=8. CROSSREFS Cf. A088876, A000312. Sequence in context: A021749 A316629 A254175 * A117966 A303932 A121891 Adjacent sequences:  A088913 A088914 A088915 * A088917 A088918 A088919 KEYWORD nonn,tabl,base AUTHOR Reinhard Zumkeller, Nov 28 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 26 22:58 EDT 2020. Contains 334634 sequences. (Running on oeis4.)