This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A247045 Triangle read by rows: T(n,k) = least number m > 0 such that m^k in base n contains exactly k distinct digits, 1 <= k <= n. 1
 1, 1, 2, 1, 3, 4, 1, 2, 3, 5, 1, 3, 3, 6, 12, 1, 3, 5, 7, 7, 15, 1, 3, 5, 9, 5, 17, 15, 1, 4, 5, 10, 9, 7, 11, 33, 1, 3, 5, 7, 11, 19, 14, 16, 53, 1, 4, 5, 6, 7, 13, 13, 14, 21, 36, 1, 4, 5, 7, 10, 8, 12, 12, 16, 42, 41, 1, 4, 6, 16, 11, 8, 19, 19, 16, 28, 35, 55, 1, 4, 6, 9, 9, 14, 10, 18, 14 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Indranil Ghosh, Rows 1..36 of triangle, flattened EXAMPLE T(n,k) is given by (row n corresponds to base n): 1; 1, 2; 1, 3, 4; 1, 2, 3,  5; 1, 3, 3,  6, 12; 1, 3, 5,  7,  7, 15; 1, 3, 5,  9,  5, 17, 15; 1, 4, 5, 10,  9,  7, 11, 33; 1, 3, 5,  7, 11, 19, 14, 16, 53; 1, 4, 5,  6,  7, 13, 13, 14, 21, 36; (base 10) 1, 4, 5,  7, 10,  8, 12, 12, 16, 42, 41; Example: T(7,3) = 5 means that 5 is the smallest number such that 5^3 in base 7 (which is 125 in base 7 = 236) has 3 distinct digits (2, 3, and 6). PROG (PARI) print1(1, ", "); n=2; while(n<20, m=1; for(k=1, n, while(m, d=digits(m^k, n); if(#vecsort(d, , 8)!=k, m++); if(#vecsort(d, , 8)==k, print1(m, ", "); m=1; break))); n++) CROSSREFS Cf. A016069, A155146, A155150. Sequence in context: A279396 A161224 A147567 * A084579 A276237 A059663 Adjacent sequences:  A247042 A247043 A247044 * A247046 A247047 A247048 KEYWORD nonn,base,tabl AUTHOR Derek Orr, Sep 10 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 May 23 03:10 EDT 2019. Contains 323507 sequences. (Running on oeis4.)