The On-Line Encyclopedia of Integer Sequences (OEIS)

The OEIS is supported by the many generous donors to the OEIS Foundation.

Revision History for A246492

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

Smallest k such that 4^^n is not congruent to 4^^(n-1) mod k, where 4^^n denotes the power tower 4^4^...^4 (in which 4 appears n times).
(history; published version)

#8 by N. J. A. Sloane at Sat Sep 06 00:19:38 EDT 2014

STATUS

reviewed

approved

#7 by Farideh Firoozbakht at Wed Sep 03 00:06:58 EDT 2014

STATUS

proposed

reviewed

#6 by Michel Marcus at Mon Sep 01 04:56:06 EDT 2014

STATUS

editing

proposed

#5 by Michel Marcus at Mon Sep 01 04:56:01 EDT 2014

KEYWORD

nonn,more,changed

STATUS

proposed

editing

#4 by Wayne VanWeerthuizen at Mon Sep 01 04:44:48 EDT 2014

STATUS

editing

proposed

#3 by Wayne VanWeerthuizen at Wed Aug 27 11:04:14 EDT 2014

PROG

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

CROSSREFS

Cf. A027763, A246491, A246493, A246494, A246495, A246496, A246497, A246498, A246499

#2 by Wayne VanWeerthuizen at Wed Aug 27 10:44:51 EDT 2014

NAME

allocated for Wayne VanWeerthuizenSmallest k such that 4^^n is not congruent to 4^^(n-1) mod k, where 4^^n denotes the power tower 4^4^...^4 (in which 4 appears n times).

DATA

2, 5, 11, 23, 47, 283, 719, 1439, 2879, 34549, 138197, 1266767, 4782969, 14348907

OFFSET

1,1

COMMENTS

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

CROSSREFS

Cf. A027763, A246491, A246493, A246494, A246495, A246496, A246497, A246498, A246499

KEYWORD

allocated

nonn

AUTHOR

Wayne VanWeerthuizen, Aug 27 2014

STATUS

approved

editing

#1 by Wayne VanWeerthuizen at Wed Aug 27 09:37:24 EDT 2014

NAME

allocated for Wayne VanWeerthuizen

KEYWORD

allocated

STATUS

approved