31242

Appears in sequences

• n written in fractional base 5/3.at n=42A024633
• If mod[n,4]=0 then a(n)=a(n-1), if mod[n,4]=1 then a(n)=a(n-2)+a(n-3), if mod[n,4]=2 then a(n)=a(n-3)+a(n-4)+a(n-5), if mod[n,4]=2 then a(n)=a(n-4)+a(n-5)+a(n-6)+a[n-7].at n=39A104205
• If mod[n,4]=0 then a(n)=a(n-1), if mod[n,4]=1 then a(n)=a(n-2)+a(n-3), if mod[n,4]=2 then a(n)=a(n-3)+a(n-4)+a(n-5), if mod[n,4]=2 then a(n)=a(n-4)+a(n-5)+a(n-6)+a[n-7].at n=40A104205
• Number of binary sequences of length n having a conjugate at Hamming distance 2.at n=40A179674
• Indices of primes in A141523.at n=40A235862
• Number of length 4+1 0..2*n arrays with the sum of the absolute values of adjacent differences equal to 4*n.at n=7A249984
• Number of n X 3 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=5A280393
• T(n,k) = Number of n X k 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=33A280398
• Number of 6Xn 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=2A280404
• Number of isomorphism classes which minimize the Wiener index among all triangulations.at n=12A333411
• a(n) = (A022010(n) - 179)/210.at n=6A357889
• a(n) = (A022013(n) - 173)/210.at n=4A357890