29450

Appears in sequences

• The convergent sequence B_n for the ternary continued fraction (3,1;2,2) of period 2.at n=13A000963
• Multiplicity of highest weight (or singular) vectors associated with character chi_5 of Monster module.at n=51A034393
• Schoenheim bound L_1(n,6,5).at n=25A036833
• Golden rectangular box numbers: a(n) = n*A007067(n)*A007067(A007067(n)).at n=19A050510
• a(n) = n*(n+1)*(n^2 - 3*n + 6)/4.at n=19A062026
• Admirable numbers n such that the subtracted divisor is > sqrt(n).at n=37A109321
• Triangle read by rows: T(n,k) is the number of paths in the first quadrant, from (0,0) to (n,0), consisting of steps U=[1,1], D[1,-1], h=(1,0) and H=(2,0), having height k (0<=k<=floor(n/2)).at n=44A132888
• Walks of length n on the x-axis using steps {1,-1} and visiting no point more than twice.at n=27A212585
• a(n) is the number of edges formed by n-secting the angles of a decagon.at n=26A335802
• Table read by antidiagonals: T(n,k) is the number of paths in the Z X Z grid joining (0,0) and (n,k) each of whose steps increases the Euclidean distance to the origin and has coordinates with absolute value at most 1.at n=38A346538
• Table read by antidiagonals: T(n,k) is the number of paths in the Z X Z grid joining (0,0) and (n,k) each of whose steps increases the Euclidean distance to the origin and has coordinates with absolute value at most 1.at n=42A346538