76096

Appears in sequences

• a(n) = a(n-1) + (3+(-1)^n)*a(n-2)/2.at n=18A007068
• a(n) = 4*a(n-1) - 2*a(n-2) with a(0) = 1, a(1) = 4.at n=9A007070
• a(0)=0; a(1)=1; a(n) = a(n-1) + (3 + (-1)^n)*a(n-2)/2.at n=20A062112
• Number of n step walks (each step +/-1 starting from 0) which are never more than 3 or less than -3.at n=18A068912
• a(n) = coefficient of x in (1+x)^n mod (1+x^4).at n=20A099587
• a(n) = coefficient of x in (1+x)^n mod (1+x^4).at n=21A099587
• Expansion of x^3 / (1 - 4*x + 6*x^2 - 4*x^3 + 2*x^4).at n=20A099589
• Row sums of triangle A099605, in which row n equals the inverse Binomial transform of column n of the triangle A034870 of even-indexed rows of Pascal's triangle.at n=9A099606
• a(n) = 4*a(n-2) - 2*a(n-4).at n=20A121720
• a(n) = 6*a(n-1) + 4*a(n-2).at n=7A135032
• a(n) = 2*{0,a(n-2),0} + 2*{-1/2,a(n-1)}+2*{a(n-1),-1/2}.at n=49A152602
• a(n) = 2*{0,a(n-2),0} + 2*{-1/2,a(n-1)}+2*{a(n-1),-1/2}.at n=50A152602
• 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=10A204089
• Number of (n+1) X 4 0..1 arrays with the number of clockwise edge increases in every 2 X 2 subblock differing from each horizontal or vertical neighbor.at n=17A205188
• Expansion of (1+2*x-x^3)/(1-4*x^2+2*x^4).at n=18A217730
• Composite numbers m such that Sum_{i=1..k} (p_i/(p_i+1)) - Product_{i=1..k} (p_i/(p_i-1)) is an integer, where p_i are the k prime factors of m (with multiplicity).at n=23A230111
• a(n) = a(n-1) + 3*a(n-2) - 2*a(n-3) - a(n-4) for n >= 4, where a(0) = 2, a(1) = 4, a(2) = 7, a(3) = 12.at n=17A288317