19107

Appears in sequences

• Positions of the flipped bits (here they are always set from 0 to 1) in the sequence A059661.at n=27A059662
• Expansion of 1 / ((1-x-x^2-x^3)*(1-x-x^3)).at n=15A103321
• Number of (1,0) steps in all paths of length n with steps U=(1,1), D=(1,-1) and H=(1,0), starting at (0,0), staying weakly above the x-axis (i.e., in all length-n left factors of Motzkin paths).at n=9A132894
• 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, 0), (-1, 0, 1), (0, -1, 1), (0, 1, 0), (1, 1, -1)}.at n=10A148201
• A156977/3.at n=30A164565
• a(n) = (6 + 10*n + 5*n^2 + n^3)/2.at n=32A164845
• Triangle T, read by rows : T(n,k) = A007318(n,k)*A005773(n+1-k).at n=46A171651
• Numbers k such that A206369(k) = A206369(k + 1).at n=22A206368
• Partial sums of A073602.at n=43A259035
• a(n) is the smallest integer not occurring earlier such that 2^a(1) + 2^a(2) + ... + 2^a(n) is a prime.at n=28A259630
• Numbers k such that 5*10^k + 59 is prime.at n=26A276492
• Number of nX3 0..1 arrays with every element equal to 1, 2, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=11A299569
• Number T(n,k) of n-step walks on cubic lattice starting at (0,0,0), ending at (0,k,n-k) and using steps (0,0,1), (0,1,0), (1,0,0), (-1,1,1), (1,-1,1), and (1,1,-1); triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=46A328347
• Number T(n,k) of n-step walks on cubic lattice starting at (0,0,0), ending at (0,k,n-k) and using steps (0,0,1), (0,1,0), (1,0,0), (-1,1,1), (1,-1,1), and (1,1,-1); triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=53A328347
• Triangle read by rows: T(n,m) = Sum_{i=1..n} C(n,i-m)*C(n+m-i,i-1)*C(n+m-i,m)/n, with T(0,0)=1.at n=57A337991