258280327

Properties

Appears in sequences

• Smallest number which when Euler phi function is repeatedly applied have not reached a power of 2 in n steps.at n=17A049117
• a(n) = 1 + 2*3^(n-1) with a(0)=2.at n=18A052919
• 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=18A053341
• a(n) is least odd integer not a partial sum of 1, 3, ..., a(n-1).at n=35A062547
• 2*3^n-(-1)^n.at n=17A081632
• Number of layers of dough separated by butter in successive foldings of croissant dough.at n=18A100702
• Primes of the form 2*3^k + 1.at n=8A111974
• Smallest prime p such that 3^n divides p^2 - 1.at n=16A125609
• Largest prime p such that phi^n(p) = 2, where phi^n means n iterations of Euler's totient function.at n=17A136041
• Least prime p of the form c*3^n+1 with c not divisible by 3.at n=17A137990
• 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=19A173927
• a(n) = 6*9^n+1.at n=8A199564
• Smallest m such that the number of iterations of "take odd part of phi" to reach 1 from m (A227944) is n.at n=18A227946
• Odd primes satisfying a specific condition (see comments).at n=17A240585
• Primes which divide a term of A073935.at n=22A286499
• Primes p such that the multiplicative order of 3 modulo p is 2 times a power of 3.at n=24A367649
• Prime numbersat n=14107188