27704

Appears in sequences

• 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, 0), (0, 1, 0), (1, 0, -1), (1, 0, 1)}.at n=8A150254
• Number of permutations of floor(i*8/3), i=0..n-1, with all sums of 3 adjacent terms unique.at n=7A152325
• Numbers n with property that n^2 is a sum of some 120 successive primes.at n=12A166262
• Triangle T(n, k, q) = Sum_{j=0..10} q^j * floor( binomial(n+1,k)*binomial(n-1,k-1)/(2^j*(n+1)) ) for q = 1, read by rows.at n=59A174043
• Triangle T(n, k, q) = Sum_{j=0..10} q^j * floor( binomial(n+1,k)*binomial(n-1,k-1)/(2^j*(n+1)) ) for q = 1, read by rows.at n=61A174043
• Modified variant of A006645, the self-convolution of the Pell series.at n=10A178159
• Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..4 array extended with zeros and convolved with 1,3,3,1.at n=21A222023
• a(n) is the smallest positive number k coprime to (2n+1)!! such that (2n+1)!! + k^2 is a square.at n=10A348635
• G.f. A(x) satisfies A(x) = 1 / ((1 + x) * (1 - x * (1 + x + x^2 + x^3) * A(x^4))).at n=17A367718