23829

Appears in sequences

• Coefficients of modular function g_3(tau).at n=7A003297
• a(n) = (5*n^2 + 1)*n^2 / 6.at n=13A008354
• Define the generalized Pisot sequence T(a(0),a(1)) by: a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n). This is T(3,5).at n=29A018917
• [ Sum{(sqrt(j+1)-sqrt(i+1))^3} ], 1 <= i < j <= n.at n=50A025223
• a(n) = a(n - 1) - 2*a(n - 2) + a(n - 3) - 2*a(n - 4) + a(n - 5).at n=44A122582
• a(n) = 1 + n*(n+1)*(n^2-n+12)/12.at n=23A136396
• a(n)= sum_{i=7..n+6} A000931(i).at n=30A167385
• Number of self-avoiding walks of length n on square lattice such that at each point the angle turns 90 degrees (the first turn is assumed to be to the left - otherwise the number must be doubled).at n=21A189722
• Triangle read by rows: T(n,k) is the number of weighted lattice paths B(n) having k HH's. B(n) is the set of lattice paths of weight n that start in (0,0), end on the horizontal axis and never go below this axis, whose steps are of the following four kinds: a (1,0)-step h of weight 1; a (1,0)-step H of weight 2; a (1,1)-step u of weight 2; a (1,-1)-step d of weight 1. The weight of a path is the sum of the weights of its steps.at n=44A246183
• Composite terms in A270951.at n=26A351337