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.

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

Table of values

n a(n)
1 3
2 5
3 11
4 23
5 47
6 283
7 719
8 1439
9 2879
10 34549
11 138197
12 1266767
13 14920303
14 36449279
15 377982107

List of values

[3, 5, 11, 23, 47, 283, 719, 1439, 2879, 34549, 138197, 1266767, 14920303, 36449279, 377982107]