20394

Appears in sequences

• 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=37A104205
• Numbers k such that k and 4*k, taken together, are pandigital.at n=3A115924
• a(n) = 1458*n - 18.at n=13A157508
• Number of length-4 0..n arrays with no repeated value greater than or equal to the previous repeated value.at n=10A269410
• Numbers k such that (397*10^k + 53)/9 is prime.at n=14A295627
• Fourier coefficients of the modular form (1/t_{6a}^3) * (1-12*sqrt(-3) / t_{6a})^(1/6) * F_{6a}^10.at n=13A341566