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!)
A152178 Smallest prime factor of G-n, where G is any sufficiently large power tower of 3, e.g., Graham's number. 2
3, 2, 5, 2, 107, 2, 3, 2, 101, 2, 29, 2, 3, 2, 13, 2, 3626257, 2, 3, 2, 7, 2, 5, 2, 3, 2, 1511, 2, 173, 2, 3, 2, 5, 2, 7, 2, 3, 2, 197, 2, 13, 2, 3, 2, 17491, 2, 18540593, 2, 3, 2, 53, 2, 5, 2, 3, 2, 19, 2, 17, 2, 3, 2, 5, 2, 11, 2, 3, 2, 29, 2, 97, 2, 3, 2, 251 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Least prime p such that A240162(p) == n (mod p). - Jinyuan Wang, Aug 30 2020
LINKS
Wikipedia, Graham's number
EXAMPLE
a(2) = 5 because 3^3^3^... - 2 = 0 (mod 5).
CROSSREFS
Sequence in context: A319044 A230820 A324549 * A274164 A103340 A106615
KEYWORD
nonn
AUTHOR
Karl W. Heuer, Nov 28 2008
STATUS
approved

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 24 15:18 EDT 2024. Contains 371960 sequences. (Running on oeis4.)