19806

Appears in sequences

• Minimal peaks in digital expansions of Pi: positions of peaks equal to 1.at n=19A105275
• 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, 0), (-1, 1, -1), (1, 0, 0), (1, 0, 1)}.at n=8A150306
• Triangle read by rows: T(n,k) is the number of permutations of [n] having k adjacent 3-cycles (0 <= k <= floor(n/3)), i.e., having k cycles of the form (i, i+1, i+2).at n=32A177250
• Number of right triangles on an (n+1) X 5 grid.at n=26A189809
• Number of (n+1)X(5+1) 0..1 arrays with nondecreasing max(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=5A250580
• Number of (n+1)X(6+1) 0..1 arrays with nondecreasing max(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=4A250581
• Number of (n+1) X (5+1) 0..1 arrays with each 2 X 2 subblock having clockwise pattern 0000 0011 or 0101.at n=11A259219
• G.f.: Product_{k>=1} (1 + x^k) / (1 - x^(k^2)).at n=38A280276
• Number of permutations of [n] having exactly two adjacent 3-cycles.at n=12A370528
• Number of subsets of 6 integers between 1 and n such that their sum is 1 modulo n.at n=23A381290