83609

Properties

Appears in sequences

• Primes p such that none of p-2, p-1, p+1, and p+2 is squarefree.at n=32A153215
• Fibonacci with priority for primes: a(0)=0, a(1)=1, for n >= 2, a(n) = a(n-1) + a(k), where 0 < k <= n-2 is maximal index such that a(n-1) + a(k) is prime. If there is no such k, then a(n) = a(n-1) + a(n-2).at n=35A216231
• Number of inequivalent tilings of a 6 X n rectangle using integer-sided square tiles.at n=8A359022
• Number of inequivalent tilings of an 8 X n rectangle using integer-sided square tiles.at n=6A359024
• Prime numbersat n=8160