57918

Appears in sequences

• Perrin sequence (or Perrin numbers, or Ondrej Such sequence): a(n) = a(n-2) + a(n-3) with a(0) = 3, a(1) = 0, a(2) = 2.at n=39A001608
• Let u be any string of n digits from {0,...,7}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-8 number; then a(n) = max_u f(u).at n=9A065849
• Perrin numbers which are divisible by their digital root.at n=17A117959
• Numbers n such that the sum of the Euler totient functions of integers up to n is a square.at n=9A130697
• a(n) = round(r^n) where r is the smallest Pisot number (real root r=1.3247179.. of x^3-x-1).at n=39A205579
• Number of minimal total dominating sets in the n-cycle graph.at n=38A300738