25650

Appears in sequences

• a(n) = ceiling(10000*log(n)).at n=12A004245
• Coefficient of x^4 in (1-x-x^2)^(-n).at n=23A006504
• Expansion of 1/eta(q)^24; Fourier coefficients of T_{14}.at n=4A006922
• If n mod 2 = 0 then a(n) = n^4/4 - 2*n^2 + 3*n; otherwise, a(n) = n^4/4 - 2*n^2 + 3*n - 5/4.at n=18A064835
• Number of 5 X n (0,1) matrices such that each row and each column is nondecreasing or nonincreasing.at n=8A086115
• 75-gonal numbers: a(n) = n*(73*n-71)/2.at n=27A098230
• Nine times hexagonal numbers: a(n) = 9*n*(2*n-1).at n=38A152994
• a(n) = 19683*n - 13716.at n=1A157666
• Numbers k such that A(k+1) = A(k) + 1, where A() = A005101() are the abundant numbers.at n=27A169822
• a(n) = floor(n^(3/2))*floor(3+n^(3/2))/2.at n=36A185593
• Number of (n+2) X 9 binary arrays avoiding patterns 001 and 110 in rows and columns.at n=2A202051
• T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 110 in rows and columns.at n=38A202052
• Triangle of coefficients of polynomials u(n,x) jointly generated with A208920; see the Formula section.at n=52A208919
• Unsigned matrix inverse of triangle A214398, as a triangle read by rows n >= 1.at n=23A215241
• G.f.: 1 = Sum_{n>=0} a(n)*x^n/(1+x)^((n+3)^2).at n=4A215243
• a(n) = 3*a(n-2) - a(n-3), with a(0)=0, a(1)=a(2)=-3.at n=18A215665
• a(n) = Sum_{i=0..n} digsum(i)^3, where digsum(i) = A007953(i).at n=54A231688
• Sum over all partitions of n into distinct parts of the bitwise XOR of the parts.at n=42A306925
• Expansion of Sum_{k>=1} k^3 * x^k/(1 - x^k)^3.at n=26A366135