86093443
domain: N
Properties
Primality
- Prime
- yes
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=17A027763
- Smallest number which when Euler phi function is repeatedly applied have not reached a power of 2 in n steps.at n=16A049117
- a(n) = 1 + 2*3^(n-1) with a(0)=2.at n=17A052919
- Euclid-Pocklington primes: primes of the form Product_{i=1..k} prime(i) * prime(k+1)^m + 1 where prime(r) is the r-th prime and Product_{i=1..k} prime(i) < prime(k+1)^m.at n=17A053341
- a(n) is least odd integer not a partial sum of 1, 3, ..., a(n-1).at n=33A062547
- Second generation sequence in which each number is skipped that can be written as sum of distinct previous entries. To make the first generation we start with all natural numbers: this gives the powers of 2 (A000079). For the second generation we start with the natural numbers from which are removed the numbers of the first generation.at n=33A072134
- Number of layers of dough separated by butter in successive foldings of croissant dough.at n=17A100702
- Primes of the form 2*3^k + 1.at n=7A111974
- Smallest prime p such that 3^n divides p^2 - 1.at n=15A125609
- Largest prime p such that phi^n(p) = 2, where phi^n means n iterations of Euler's totient function.at n=16A136041
- Primes that divide 2^(3^n)+1 for some n.at n=13A136474
- Least prime p of the form c*3^n+1 with c not divisible by 3.at n=16A137990
- Integers k such that k-1,k,k+1 have few distinct primes: k=p^r, p odd prime, and (k^2-1)/8 divisible by at most two distinct prime factors.at n=19A172095
- 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=18A173927
- 2*3^(n-1)-(-1)^n.at n=16A174132
- a(n) = 2*9^n+1.at n=8A199559
- Prime numbers p such that p^2 - 1 has exactly one distinct prime factor other than 2 and 3.at n=29A215504
- Smallest m such that the number of iterations of "take odd part of phi" to reach 1 from m (A227944) is n.at n=17A227946
- Odd primes satisfying a specific condition (see comments).at n=13A240585
- Position of first appearance of n in A256757.at n=18A256758