138197

Properties

Appears in sequences

• Smallest k such that 2^^n is not congruent to 2^^(n-1) mod k, where 2^^n denotes the power tower 2^2^...^2 (in which 2 appears n times).at n=11A027763
• a(n) is the least prime of class n-, according to the Erdős-Selfridge classification of primes.at n=9A056637
• Class 10- primes.at n=0A081429
• Let f(p) = greatest prime divisor of p-1. Sequence gives smallest prime which takes at least n steps to reach 2 when f is iterated.at n=10A082449
• Smallest integer k such that the number of iterations of Carmichael lambda function (A002322) needed to reach 1 starting at k (k is counted) is n.at n=12A173927
• Smallest k such that 3^^n is not congruent to 3^^(n-1) mod k, where 3^^n denotes the power tower 3^3^...^3 (in which 3 appears n times).at n=10A246491
• 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).at n=10A246492
• Smallest k such that 6^^n is not congruent to 6^^(n-1) mod k, where 6^^n denotes the power tower 6^6^...^6 (in which 6 appears n times).at n=9A246494
• Smallest k such that 7^^n is not congruent to 7^^(n-1) mod k, where 7^^n denotes the power tower 7^7^...^7 (in which 7 appears n times).at n=10A246495
• 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).at n=10A246496
• 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).at n=9A246497
• Positions of records in A297025.at n=27A297026
• Prime numbersat n=12859