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.

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

Original entry on oeis.org

2, 3, 11, 23, 47, 283, 719, 1439, 2879, 34549, 138197, 1266767, 14920303
Offset: 1

Views

Author

Wayne VanWeerthuizen, Aug 27 2014

Keywords

Comments

For general remarks regarding sequences of this type, see A246491.

Crossrefs

Large overlap with A056637.