22288

Appears in sequences

• a(n) = a(n-1) + (3+(-1)^n)*a(n-2)/2.at n=16A007068
• a(n) = 4*a(n-1) - 2*a(n-2) with a(0) = 1, a(1) = 4.at n=8A007070
• Convolution of (1, p(1), p(2), ...) and composite numbers.at n=28A023627
• Triangle of coefficients arising in calculation of A002872 and A002874 (sorting numbers).at n=34A036073
• a(0)=0; a(1)=1; a(n) = a(n-1) + (3 + (-1)^n)*a(n-2)/2.at n=18A062112
• Smallest multiple of n-th prime with all even digits.at n=45A062281
• Number of n step walks (each step +/-1 starting from 0) which are never more than 3 or less than -3.at n=16A068912
• Constant term in (1+x)^n mod (1+x^4).at n=17A099586
• Constant term in (1+x)^n mod (1+x^4).at n=18A099586
• Coefficient of x^2 in (1+x)^n mod 1+x^4.at n=18A099588
• Expansion of x^3 / (1 - 4*x + 6*x^2 - 4*x^3 + 2*x^4).at n=19A099589
• a(n) = 4*a(n-2) - 2*a(n-4).at n=18A121720
• a(n) = 144*n^2 - 161*n + 45.at n=12A156711
• Number of different hook length multisets of partitions of n.at n=41A180652
• The number of 1 by n Haunted Mirror Maze puzzles with a unique solution ending with a mirror, where mirror orientation is fixed.at n=9A204089
• Expansion of (1+2*x-x^3)/(1-4*x^2+2*x^4).at n=16A217730
• T(n,k)=Number of nXk 0..3 arrays of the sum of the corresponding element, the element to the east and the element to the south in a larger (n+1)X(k+1) 0..1 array.at n=28A229392
• T(n,k)=Number of nXk 0..3 arrays of the sum of the corresponding element, the element to the east and the element to the south in a larger (n+1)X(k+1) 0..1 array.at n=35A229392
• Eighth arithmetic derivative of n.at n=56A258648
• Eighth arithmetic derivative of n.at n=60A258648