proposed
approved
proposed
approved
editing
proposed
editing
approved
k = 0; Join[{1}, Table[While[d = IntegerDigits[11^k]; prt = Partition[Differences[d], n - 1, 1]; ! MemberQ[prt, Table[0, {n - 1}]], k++]; Length[d], {n, 2, 8}]] (* T. D. Noe, Oct 03 2012 *)
Number of digits in 11^k is equal to ceilfloor(1 + k*log_10(11)).
allocated for V. Raman
a(n) is the number of digits in the decimal representation of the smallest power of 11 that contains n consecutive identical digits.
1, 2, 9, 41, 163, 502, 1378, 3107, 9834
1,2
Number of digits in 11^k is equal to ceil(k*log_10(11)).
allocated
nonn,base
V. Raman, Sep 27 2012
approved
editing
allocated for V. Raman
allocated
approved