101639

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=41A001608
• Numbers n such that sopf(n) = sopf(n-1) - sopf(n-2), where sopf(x) = sum of the distinct prime factors of x.at n=16A076527
• a(n) = round(r^n) where r is the smallest Pisot number (real root r=1.3247179.. of x^3-x-1).at n=41A205579
• Number of distinct values of the sum of 3 products of three 0..n integers.at n=33A225260
• Number of minimal total dominating sets in the n-cycle graph.at n=40A300738