25840

Appears in sequences

• Fibonacci sequence beginning 0, 10.at n=18A022093
• Row 9 of array in A288580.at n=19A092974
• a(n) = binomial(n+2,2)*binomial(n+5,2).at n=15A105938
• Triangle T(n,k), 0<=k<=n, defined by T(n,k) = 0 if k<0 or k>n, T(0,0) = 1, T(n,k) = T(n,k-1)+T(n-1,k-1)+T(n-1,k)+T(n-1,k+1).at n=26A122479
• Place n points on each of the three sides of a triangle, 3n points in all; a(n) = number of nondegenerate triangles that can be constructed using these points (plus the 3 original vertices) as vertices.at n=17A130748
• a(1)=1, a(n) = a(n-1) + n^5 if n odd, a(n) = a(n-1) + n^4 if n is even.at n=7A135214
• a(n) = a(n-1) + 2*a(n-2) - a(n-3) - a(n-4), a(0)=0, a(1)=8, a(2)=10, a(3)=18.at n=18A153382
• a(n) = Floor(Fibonacci(n)^(1/Pi)).at n=68A171962
• Concatenation of the decimal digits of Fibonacci(n) and the Fibonacci(n)-th digit of Pi.at n=18A201773
• Number of n X 4 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=34A208375
• a(n) = (Lucas(4n) - Lucas(2n))/4.at n=6A215465
• Number of 4 X n 0..1 arrays with rows nondecreasing and antidiagonals unimodal.at n=14A224135
• Rounded sums of the non-integer cube roots of n, as partitioned by the integer roots: round(Sum_{j=n^3+1..(n+1)^3-1} j^(1/3)).at n=20A248575
• Expansion of Product_{k>=1} 1/(1-x^(2*k-1))^(2*k-1).at n=25A262811