|
|
A323453
|
|
Largest number that can be obtained by starting with 1 and applying "Choix de Bruxelles (version 2)" (see A323460) n times.
|
|
5
|
|
|
1, 2, 4, 8, 16, 112, 224, 512, 4416, 44112, 88224, 816448, 8164416, 81644112, 811288224, 8112816448, 81128164416, 811281644112, 8112811288224, 81128112816448, 811281128164416, 8112811281644112, 81128112811288224, 811281128112816448, 8118112281128164416, 81181122811281644112
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Also, largest number that can be obtained by starting with 1 and applying the original "Choix de Bruxelles" version 1 operation (as defined in A323286) at most n times.
a(n) is the largest number that can be obtained by applying Choix de Bruxelles (version 2) to all the numbers that can be reached from 1 by applying it n-1 times.
|
|
LINKS
|
|
|
FORMULA
|
a(n+4) = decimal concatenation of 8112 and a(n) for n >= 10.
|
|
EXAMPLE
|
After applying Choix de Bruxelles (version 2) 4 times to 1, we have the numbers {1,2,4,8,16}. Applying it a fifth time we get the additional numbers {13,26,32,112}, so a(5) = 112.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|