39371

Properties

Appears in sequences

• Boustrophedon transform of Bell numbers.at n=8A000764
• Numbers that are the sum of 7 positive 9th powers.at n=15A003396
• Number of base-5 (n+1)-digit numbers starting with a zero and with adjacent digits differing by one or less.at n=11A057960
• Primes p such that p-5 == 0 (mod phi(p-5)).at n=36A067557
• Expansion of e.g.f. (1+x)*exp(2*x)*cosh(x).at n=9A082306
• a(n) = (1/n!)*A001565(n).at n=33A094792
• Primes p such that p's set of distinct digits is {1,3,7,9}.at n=29A108386
• Number of parts > 1 in the last section of the set of partitions of n.at n=38A138135
• Emirps using each of the digits 1, 3, 7, 9 at least once, but no others.at n=11A158917
• Number of parts in all partitions of 2n+1 that do not contain 1 as a part.at n=19A182735
• Primes of the form 2n^3+5.at n=7A201109
• Primes of the form 6n^2 + 5.at n=26A201600
• Primes of the form 7n^2 - 4.at n=8A201850
• Emirps whose internal digits are also an emirp.at n=33A225235
• Primes p such that every suffix of the ternary (base-3) representation of p is a prime.at n=41A278696
• Define a set of generalized Syracuse sequences starting with x(1)=2*n+1 a positive odd integer, if x(i) is odd prime set x(i+1)=67*x(i)+1, if x(i) is odd not prime set x(i+1)=3*x(i)+1 and if x(i) is even then set x(i+1)=x(i)/2. Then a(n) is the first index i > 1 at which x(i) reaches 1.at n=25A300286
• Position of the first occurrence of n in A337474.at n=43A337476
• Prime numbersat n=4145