33004

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=37A001608
• Number of irreducible positions of size n in Montreal solitaire.at n=11A007048
• Integers that are Rhonda numbers to base 15.at n=11A100974
• a(n) = floor(r^n) where r is the smallest Pisot number (real root r=1.3247179... of x^3-x-1).at n=37A112639
• Perrin numbers for which the sum of the digits is also a Perrin number.at n=11A117593
• Perrin numbers which are divisible by their digital root.at n=16A117959
• a(n) = round(r^n) where r is the smallest Pisot number (real root r=1.3247179.. of x^3-x-1).at n=37A205579
• Number of length 3 1..(n+1) arrays with every leading partial sum divisible by 2, 3 or 5.at n=42A254830
• Partial sums of A299272.at n=29A299273
• Number of minimal total dominating sets in the n-cycle graph.at n=36A300738
• a(n) = number of primes between n^2 and n^4.at n=25A380332