31997

Appears in sequences

• a(0)=4, a(1)=0, a(2)=0, a(3)=3; thereafter a(n) = a(n-3) + a(n-4).at n=52A050443
• Start with a(1)=1; now a(n+1)=a(n)+a(k) with k=[n-n-th digit of Pi]. If k<0 or k=0, then a(k)=0.at n=39A133389
• Number of nonnegative integer arrays of length 2n+5 with new values 0 upwards introduced in order, no three adjacent elements all unequal, and containing the value n+1.at n=21A211850
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 161", based on the 5-celled von Neumann neighborhood.at n=28A286165