178364

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=43A001608
• a(n) = floor(r^n) where r is the smallest Pisot number (real root r=1.3247179... of x^3-x-1).at n=43A112639
• Perrin numbers for which the sum of the digits is also a Perrin number.at n=13A117593
• Perrin numbers which are divisible by their digital root.at n=20A117959
• a(n) = round(r^n) where r is the smallest Pisot number (real root r=1.3247179.. of x^3-x-1).at n=43A205579
• Number of minimal total dominating sets in the n-cycle graph.at n=42A300738