115136

Appears in sequences

• Number of steps to compute the n-th prime in PRIMEGAME using Kilminster's Fractran program with only nine fractions.at n=16A183133
• Decimal representation of the n-th iteration of the "Rule 121" elementary cellular automaton starting with a single ON (black) cell.at n=8A267294
• E.g.f. A(x) satisfies A(x) = exp( x*A(x) * A(x*A(x))^2 ).at n=5A384691
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of e.g.f. B(x)^k, where B(x) is the e.g.f. of A384691.at n=26A384692