38560

Appears in sequences

• Triangle read by rows: T(n,k) is the number of Motzkin paths of length n and having k weak ascents (1 <= k <= ceiling(n/2)).at n=51A114690
• Greatest number m such that the fractional part of (10/9)^A153695(m) >= 1-(1/m).at n=16A153699
• Number of strings of numbers x(i=1..n) in 0..n with sum i*x(i)^2 equal to n^3.at n=7A184433
• Number of strings of numbers x(i=1..n) in 0..8 with sum i*x(i)^2 equal to n*64.at n=7A184440
• Number of strings of numbers x(i=1..8) in 0..n with sum i*x(i)^2 equal to n*64.at n=7A184447
• Number of arrays of 2n nondecreasing integers in -3..3 with sum zero and equal numbers greater than zero and less than zero.at n=28A203286
• a(0)=a(1)=1, a(n) = a(n-1) + a(a(n-2) mod n).at n=48A215525
• E.g.f. A(x) satisfies: A(x)^A(x) = 1/(1 - x*A(x)^3).at n=5A216136
• Maximum number of copies of a 1234 permutation pattern in an alternating (or zig-zag) permutation of length n + 5.at n=28A338429