login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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). 7
2, 3, 11, 23, 47, 283, 719, 1439, 2879, 34549, 138197, 1266767, 14920303 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

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

LINKS

Table of n, a(n) for n=1..13.

PROG

(Sage, cython) Use linked source from A246491 with this command: find_k_values(8, 1, 1)

CROSSREFS

Cf. A027763, A056637, A246491 - A246497

Sequence in context: A040994 A141123 A263729 * A119641 A252005 A074496

Adjacent sequences:  A246493 A246494 A246495 * A246497 A246498 A246499

KEYWORD

nonn,more

AUTHOR

Wayne VanWeerthuizen, Aug 27 2014

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 11 15:12 EDT 2020. Contains 336428 sequences. (Running on oeis4.)