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!)
 A239306 Triangle read by rows: T(n,k) = least number m > 0 such that m^m contains exactly k distinct digits in base n, 1 <= k <= n, or 0 if no such m exists. 2
 1, 1, 2, 1, 3, 5, 1, 2, 3, 6, 1, 5, 3, 6, 11, 1, 3, 4, 10, 7, 9, 1, 3, 4, 8, 5, 10, 9, 1, 4, 5, 0, 7, 10, 17, 13, 1, 3, 4, 0, 7, 18, 15, 11, 16, 1, 3, 4, 5, 7, 14, 9, 11, 13, 19, 1, 3, 4, 5, 6, 0, 10, 9, 14, 17, 16, 1, 3, 4, 5, 8, 9, 10, 18, 23, 17, 15, 27, 1, 3, 4, 0, 6, 26, 9, 15, 14, 11 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS EXAMPLE T(n,k) is given by (row n corresponds to base n): 1; 1, 2; 1, 3, 5; 1, 2, 3,  6; 1, 5, 3,  6, 11; 1, 3, 4, 10,  7,  9; 1, 3, 4,  8,  5, 10,  9; 1, 4, 5,  0,  7, 10, 17, 13; 1, 3, 4,  0,  7, 18, 15, 11, 16; 1, 3, 4,  5,  7, 14,  9, 11, 13, 19; (base 10) 1, 3, 4,  5,  6,  0, 10,  9, 14, 17, 16; 1, 3, 4,  5,  8,  9, 10, 18, 23, 17, 15, 27; 1, 3, 4,  0,  6, 26,  9, 15, 14, 11, 16, 20, 19; 1, 3, 5,  6,  8, 10,  9, 12, 42, 13, 18, 16, 22, 29; PROG (PARI) a(n, b)=k=1; while(#vecsort(digits(k^k, b), , 8)!=n, if(#digits(k^k)>100*n, return(0)); k++); k print1(1, ", "); b=2; while(b<20, for(n=1, b, print1(a(n, b), ", ")); b++) CROSSREFS Sequence in context: A188732 A085189 A130466 * A129322 A089984 A284429 Adjacent sequences:  A239303 A239304 A239305 * A239307 A239308 A239309 KEYWORD nonn,base,tabl AUTHOR Derek Orr, Sep 30 2014 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 November 27 16:20 EST 2021. Contains 349394 sequences. (Running on oeis4.)