|
|
A215737
|
|
a(n) is the first digit to appear n times in succession in a power of 11.
|
|
13
|
|
|
1, 1, 8, 7, 6, 0, 6, 0, 9, 6, 6, 2, 2, 7, 6
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
MATHEMATICA
|
n = 1; x = 1; lst = {};
For[i = 1, i <= 10000, i++,
z = Split[IntegerDigits[x]]; a = Length /@ z; b = Max[a];
For[j = n, j <= b, j++,
AppendTo[lst, First[First[Part[z, First[Position[a, b]]]]]]; n++
|
|
PROG
|
(Python)
a, s = 1, tuple(str(i)*n for i in range(10))
while True:
a *= 11
t = str(a)
for i, x in enumerate(s):
if x in t:
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
a(10)-a(13) added by V. Raman, Apr 30 2012, in correspondence with A215731.
|
|
STATUS
|
approved
|
|
|
|