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.

A217727 a(1)=2. For n >= 1, let k = floor(log a(n)). If k >= 2 and k is not already in the sequence then a(n+1)=k, otherwise a(n+1)=a(n)^2.

Table of values

n a(n)
1 2
2 4
3 16
4 256
5 5
6 25
7 3
8 9
9 81
10 6561
11 8
12 64
13 4096
14 16777216
15 281474976710656
16 33
17 1089
18 6
19 36
20 1296
21 7
22 49
23 2401
24 5764801
25 15
26 225
27 50625
28 10
29 100
30 10000
31 100000000
32 18
33 324
34 104976
35 11
36 121
37 14641
38 214358881
39 19
40 361
41 130321
42 16983563041
43 23
44 529
45 279841
46 12
47 144
48 20736
49 429981696
50 184884258895036416
51 39

List of values

[2, 4, 16, 256, 5, 25, 3, 9, 81, 6561, 8, 64, 4096, 16777216, 281474976710656, 33, 1089, 6, 36, 1296, 7, 49, 2401, 5764801, 15, 225, 50625, 10, 100, 10000, 100000000, 18, 324, 104976, 11, 121, 14641, 214358881, 19, 361, 130321, 16983563041, 23, 529, 279841, 12, 144, 20736, 429981696, 184884258895036416, 39]