38409

Appears in sequences

• Numbers n such that mu(n) + mu(n+1) + mu(n+2) + mu(n+3) + mu(n+4) + mu(n+5) + mu(n+6) = 6.at n=25A082967
• a(n) is the number of nonnegative integers k less than 10^n such that the decimal representation of k lacks the digit 1, at least one of digits 2,3, at least one of digits 4,5 and at least one of digits 6,7,8,9.at n=4A126631
• 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, -1, 0), (0, 1, -1), (1, 0, -1), (1, 1, 1)}.at n=9A149533
• Partial sums of A151782.at n=37A151793
• a(n) = 49*n^2 - 7.at n=27A158484
• Triangle T(n,k): number of ways of partitioning the n-element multiset {1,1,2,3,...,n-1} into exactly k nonempty parts, n>=1 and 1<=k<=n.at n=61A241500
• Number of (n+1) X (2+1) 0..1 arrays with each 2 X 2 subblock having clockwise pattern 0000 0001 0101 0111.at n=5A259509
• Number of (n+1)X(6+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0001 0101 0111.at n=1A259513
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0001 0101 0111.at n=22A259515
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0001 0101 0111.at n=26A259515
• Triangular array read by rows. T(n,k) is the number of binary relations R on [n] such that the unique idempotent in {R^i:i>=1} contains exactly k non-arcless strongly connected components, n>=0, 0<=k<=n.at n=11A370464