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.

A027763 Smallest k such that 2^^n is not congruent to 2^^(n-1) mod k, where 2^^n denotes the power tower 2^2^...^2 (in which 2 appears n times).

Table of values

n a(n)
1 2
2 3
3 5
4 11
5 23
6 47
7 283
8 719
9 1439
10 2879
11 34549
12 138197
13 531441
14 1594323
15 4782969
16 14348907
17 43046721
18 86093443
19 344373773
20 688747547
21 3486784401

List of values

[2, 3, 5, 11, 23, 47, 283, 719, 1439, 2879, 34549, 138197, 531441, 1594323, 4782969, 14348907, 43046721, 86093443, 344373773, 688747547, 3486784401]