cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A323453 Largest number that can be obtained by starting with 1 and applying "Choix de Bruxelles (version 2)" (see A323460) n times.

Table of values

n a(n)
0 1
1 2
2 4
3 8
4 16
5 112
6 224
7 512
8 4416
9 44112
10 88224
11 816448
12 8164416
13 81644112
14 811288224
15 8112816448
16 81128164416
17 811281644112
18 8112811288224
19 81128112816448
20 811281128164416
21 8112811281644112
22 81128112811288224
23 811281128112816448
24 8118112281128164416
25 81181122811281644112

List of values

[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]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.