33098

Appears in sequences

• a(n) = floor(Pi^n mod n^Pi).at n=32A066434
• a(n) = C(1,1) + C(3,2) + C(5,3) + ... + C(2*n-1,n).at n=8A079309
• Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k horizontal segments (a horizontal segment is a maximal string of horizontal steps).at n=34A104549
• a(n) = 49*n^2 - n.at n=25A157923
• a(n) = 196*n^2 - 2*n.at n=12A158224
• a(n) = 676*n^2 - 26.at n=6A158639
• Expansion of (1+2x-sqrt(1-4x^2))/(2(1-x^2)*sqrt(1-4x^2)).at n=18A174783
• Number of base pyramids in all length n left factors of Dyck paths.at n=18A191790
• Number of (w,x,y,z) with all terms in {1,...,n} and w+|x-y|<=|x-z|+|y-z|.at n=39A212691
• a(n) = Sum_{k=1..n-1} ((-1)^(k+n+1)*binomial(k,floor(k/2))).at n=18A332754
• Starts of runs of 3 consecutive numbers with the same total binary weight of their divisors (A093653).at n=19A338453
• Number of nonempty subsets of {1..n} with median n/2.at n=18A361801
• Number of nonempty subsets of {1..n} with median n/2.at n=19A361801