66861

Appears in sequences

• a(n) = binomial(n+4,4)*(4*n+5)/5.at n=16A034263
• G.f.: 1/((1-x)*(1-x^2))^3.at n=32A038163
• Distinct odd numbers in the numerators of the 1/5-Pascal triangle (by row).at n=47A046624
• Distinct odd numbers in writing first numerator and then denominator of each element to the right of the central elements of the 1/5-Pascal triangle (by row).at n=46A046628
• a(1) = 1; a(n) = floor {(n+1)(n+2)(n+3)...(n+k)}/{(n-1)(n-2)(n-3)...(n-k)} for the least value of k.at n=15A092935
• Expansion of q^(-1/3) * eta(q^6)^2 / (eta(q) * eta(q^3)) in powers of q.at n=40A097197
• Expansion of psi(-q^3) / f(q) where psi(), f() are Ramanujan theta functions.at n=40A139135
• 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, -1, -1), (-1, 0, 1), (0, 1, 0), (1, 0, 0), (1, 0, 1)}.at n=8A151092
• Triangle read by rows: the x = 1+q Narayana triangle at m=3.at n=26A243661
• a(n) = n*(n + 1)*(n + 2)*(n^2 - n + 4)/24.at n=16A256859
• Number of nX3 0..1 arrays with every element equal to 0, 1, 3 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=13A302422
• Number of minimal total dominating sets in the n X n white bishop graph.at n=6A303229
• Number of minimal total dominating sets in the n X n black bishop graph.at n=7A303230
• Number of nX6 0..1 arrays with every element unequal to 0, 1, 2, 5 or 6 king-move adjacent elements, with upper left element zero.at n=7A304602