42808

Appears in sequences

• a(n) = floor( n*(n-1)*(n-2)*(n-3)/26 ).at n=34A011936
• Let u(1)=u(2)=1, u(3)=2n, u(k) = abs(u(k-1)-u(k-2)-u(k-3)) and M(k) = Max_{i<=i<=k} u(i), then for any k >= A078109(n), M(k) = floor(sqrt(k + a(n))).at n=29A078108
• Triangle read by rows: T(n,k) = number of permutations p of 1,...,n, with min(|p(i)-p(i-1)|, i=2..n) = k (n>=2, k>=1).at n=22A129534
• The number of integer partitions P of n such that either the length k of P is not a part or P has at least one part equal to 1 (or both).at n=41A229863
• Sum of the lengths of the first descents in all bargraphs having semiperimeter n (n>=2). A descent is a maximal sequence of consecutive down steps.at n=10A276068
• Numbers k such that (11*10^k - 113) / 3 is prime.at n=24A280557