login
The OEIS is supported by the many generous donors to the OEIS 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

%I #10 Nov 16 2014 14:36:40

%S 2,3,11,23,47,283,719,1439,2879,34549,138197,1266767,14920303

%N 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).

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

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

%Y Cf. A027763, A056637, A246491 - A246497

%K nonn,more

%O 1,1

%A _Wayne VanWeerthuizen_, Aug 27 2014

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)