40257

Appears in sequences

• Number of intersections of diagonals in the interior of a regular n-gon.at n=33A006561
• The following triangle is based on Pascal's triangle. The r-th term of the n-th row is sum of C(n,r) successive integers so that the sum of all the terms of the row is (2^n)*(2^n+1)/2, the 2^n -th triangular number. Sequence contains the triangle read by rows.at n=50A112358
• E.g.f. A(x) satisfies: A(x) = 1 + x*exp(Integral A(x)^2 dx).at n=7A143922
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 1), (1, 0, -1), (1, 0, 1)}.at n=10A148732
• Numbers k such that the sum of the divisors of k and the sum of the distinct prime divisors of k are both a square.at n=34A194196
• Number of partitions p of n such that (number of distinct parts of p) < max(p) - min(p).at n=41A239954
• Iterates of A234742, starting from value a(0) = 1361, with a(1) = A234742(a(0)), a(2) = A234742(a(1)), etc.at n=3A260441
• Numbers m such that both m^2-1 and m^2 are refactorable numbers (A033950) and that m^2 has more divisors than m^2-1.at n=18A342970