19449

Appears in sequences

• Shifts left under transform T where Ta is product of Partition Triangle A008284 with a.at n=13A039808
• Expansion of (1-x)^2/((1-x)^3-4x^4).at n=14A097121
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (0, -1, 1), (0, 1, 1), (1, 1, -1), (1, 1, 1)}.at n=7A151007
• G.f.: exp( Sum_{n>=0} [ Sum_{k=0..2*n} A027907(n,k)^2 * x^k ]* x^n/n ), where A027907 is the triangle of trinomial coefficients.at n=11A186236
• Number of n X n 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 4,2,3,0,1 for x=0,1,2,3,4.at n=4A196803
• Number of nX5 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 4,2,3,0,1 for x=0,1,2,3,4.at n=4A196806
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 4,2,3,0,1 for x=0,1,2,3,4.at n=40A196809
• Number of 5-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero and first and second differences in -n..n.at n=21A209009
• Number of (w,x,y,z) with all terms in {1,...,n} and w*x < 2*y*z.at n=13A211795
• Number of Dyck n-paths all of whose ascents have lengths equal to 1 (mod 9).at n=17A212389
• G.f. A(x) = Sum_{n=-oo..+oo} x^n * (1 + x^n)^(2*n).at n=68A260147
• Expansion of Sum_{k>=0} (x/(1 - x))^(k^3).at n=18A280351
• Numbers k such that k!4 + 2^7 is prime, where k!4 = k!!!! is the quadruple factorial number (A007662).at n=21A291348
• Numbers k such that k![4] - 4 is prime, where k![4] = A007662(k) = quadruple factorial.at n=41A328454
• Numbers k such that A234575(k,s) = s^2 where s = A007953(k).at n=34A358034
• G.f. satisfies A(x) = 1 + x^4*A(x)*(1 + x*A(x)).at n=40A365727
• Expansion of (1 + x^4 - x^5)/((1 + x^4 - x^5)^2 - 4*x^4).at n=35A376728
• a(n) = Sum_{k=0..floor(5*n/9)} binomial(k,5*n-9*k).at n=32A392356
• a(n) = Sum_{k=0..floor(n/3)} binomial(k+1,3*n-9*k+1).at n=50A392675