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!)
A246497 Smallest k such that 9^^n is not congruent to 9^^(n-1) mod k, where 9^^n denotes the power tower 9^9^...^9 (in which 9 appears n times). 7

%I #14 Sep 06 2014 00:24:49

%S 3,7,23,47,283,719,1439,2879,34549,138197,1266767,14619833,36449279,

%T 377982107,1432349099

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

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

%C This particular sequence shares all known terms with A082449. they might be identical.

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

%Y Cf. A082449, A027763, A246491, A246492, A246493, A246494, A246495, A246496.

%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 19 17:51 EDT 2024. Contains 371797 sequences. (Running on oeis4.)