21359

Appears in sequences

• From George Gilbert's marks problem: jumping 6 marks at a time (final positions).at n=13A019996
• Multiplicity of highest weight (or singular) vectors associated with character chi_133 of Monster module.at n=39A034521
• Triangle read by rows: T(n,k) is number of Dyck n-paths with k UUDDs, 0 <= k <= n/2.at n=37A098978
• Positive integers i for which A112049(i) == 8.at n=23A112068
• a(n) = n*(n^2 + 3*n + 5)/3.at n=39A145069
• Triangle read by rows: T(n,k) is the number of length n left factors of Dyck paths having k UUDD's, where U=(1,1) and D=(1,-1).at n=55A191793
• Number of length n left factors of Dyck paths having no UUDD's; here U=(1,1) and D=(1,-1).at n=19A191794
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 825", based on the 5-celled von Neumann neighborhood.at n=26A273581
• The number of peaks of width 1 (i.e., UHD configurations, where U = (0,1), H=(1,0), D=(0,-1)) in all bargraphs of semiperimeter n (n>=2).at n=10A273716
• G.f. A(x) satisfies: Series_Reversion( A(x) + A(x)^4 ) = A(x) - A(x)^4.at n=4A277294
• Numbers of the form HMMSS with primes H < 24 and MM, SS < 60, for which the number of seconds after midnight, 3600*H+60*MM+SS, is also prime.at n=32A295011