100284

Appears in sequences

• Least k > 0 such that the nextprime(k*primorial(n)) - k*primorial(n) is composite.at n=4A071771
• Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k up steps starting at even heights.at n=57A101919
• Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k up steps starting at an odd height.at n=46A101920
• Triangle read by rows: T(n,k) is number of ordered trees with n edges and having exactly k vertices all of whose children are leaves (1<=k<=floor(n/2) for n>=2).at n=32A114502
• Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k peak plateaux (0<=k<=floor(n/2)). A peak plateau is a run of consecutive peaks that is preceded by an upstep and followed by a down step; a peak consists of an upstep followed by a downstep.at n=44A143952
• 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, 1), (0, 1, 0), (1, 1, -1), (1, 1, 0)}.at n=9A150172
• Triangle read by rows: T(n,k) is the number of bargraphs of semiperimeter n having k peaks (n >= 2, k >= 1).at n=28A271940
• Lexicographically earliest sequence of distinct terms > 0 such that the sum a(n) + a(n+1) is a substring of the concatenation (a(n), a(n+1)).at n=8A359482