39367

Properties

Appears in sequences

• Numbers that are the sum of 7 nonzero 8th powers.at n=33A003385
• Numbers that are the sum of 3 positive 9th powers.at n=7A003392
• Numbers that are the sum of at most 3 positive 9th powers.at n=17A004887
• Numbers that are the sum of at most 4 positive 9th powers.at n=26A004888
• Numbers that are the sum of at most 5 positive 9th powers.at n=37A004889
• Class 1- (or Pierpont) primes: primes of the form 2^t*3^u + 1.at n=29A005109
• Positions where A007600 increases.at n=29A007601
• a(n) = 2*n^3 + 1.at n=27A033562
• Smallest number which when Euler phi function is repeatedly applied have not reached a power of 2 in n steps.at n=9A049117
• a(n) = 1 + 2*3^(n-1) with a(0)=2.at n=10A052919
• 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=12A053341
• Primes p whose period of reciprocal equals (p-1)/9.at n=33A056214
• Primes of form 1+(2^a)*(3^b), a>0, b>0.at n=24A058383
• Primes p such that x^27 = 2 has no solution mod p, but x^9 = 2 has a solution mod p.at n=19A059354
• Primes p such that x^54 = 2 has no solution mod p, but x^18 = 2 has a solution mod p.at n=10A059666
• a(n) is least odd integer not a partial sum of 1, 3, ..., a(n-1).at n=19A062547
• Primes p such that p-1 divides 2^p-2.at n=23A069051
• Primes p such that x^9 = 2 has a solution mod p, but x^(9^2) = 2 has no solution mod p.at n=20A070185
• 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=19A072134
• 2*3^n-(-1)^n.at n=9A081632