40956

Appears in sequences

• Dirichlet convolution of 3^(n-1) with Bell numbers.at n=9A034756
• a(n) = T(4,n), array T given by A048483.at n=13A048487
• Numbers k such that 6*k+5, 6*k+11, 6*k+17, 6*k+23 are consecutive primes.at n=35A090836
• Start with 1, then alternately add 2 or double.at n=26A123208
• Those n for which A140259(n) = A002264(n+11).at n=21A140260
• a(n) is one fourth of the total number of free ends of 4 line segments expansion at n iterations (see Comments lines for definition).at n=26A238549
• Start at a(0)=1. a(n) = a(n-1)+2 if n == 1,2 (mod 3) and a(n)=a(n-1)+a(n-3) if n == 0 (mod 3).at n=39A268896
• Expansion of (x - x^2 + 2*x^3 + 2*x^4)/(1 - 3*x + 2*x^2).at n=15A270810
• Number of nX4 0..1 arrays with each 1 adjacent to 1, 3 or 4 king-move neighboring 1s.at n=5A296800
• Number of n X 6 0..1 arrays with each 1 adjacent to 1, 3 or 4 king-move neighboring 1's.at n=3A296802
• T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 1, 3 or 4 king-move neighboring 1s.at n=39A296804
• T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 1, 3 or 4 king-move neighboring 1s.at n=41A296804
• G.f. A(x) satisfies 1/2 = Sum_{n=-oo..+oo} x^n * (A(x) + x^n)^(2*n-1).at n=5A380068