37600

Appears in sequences

• Almost trivalent maps.at n=3A002007
• Number of 4-line partitions of n decreasing across rows.at n=27A003292
• Number of partitions of n-set into odd blocks.at n=11A003724
• Expansion of e.g.f. cosh(sinh(x))/exp(x).at n=10A009152
• Numbers k such that the decimal expansion of k^2 contains k as a substring.at n=28A018834
• Substring of both its square and its cube.at n=26A029943
• Internal digits of n^2 include digits of n as substring.at n=15A046836
• Binomial transform of expansion of cosh(sinh(x)).at n=10A081443
• Triangle read by rows: T(n,k) = number of configurations of k non-attacking bishops on the white squares of an n X n chessboard (for n even, 0 <= k < n).at n=27A088960
• Triangle read by rows: T(n,k) is the number of set partitions of {1,2,...,n} (or of any n-set) having k blocks of even size (0<=k<=floor(n/2)).at n=36A124322
• a(n) = 94*n^2.at n=20A174337
• Consider a number n with m decimal digits. The sequence lists the numbers n having the prefix of length m-1 in the middle of the decimal expansion of n^2.at n=15A242942
• Triangle read by rows: T(n,k) = number of configurations of k nonattacking bishops on the black squares of an n X n chessboard (0 <= k <= n - [n>1]).at n=54A274105
• Triangle read by rows: T(n,k) = total number of configurations of k nonattacking bishops on the white squares of an n X n chessboard (0 <= k <= n-1+[n=0]).at n=53A274106
• Square array read by descending antidiagonals: (-1)^n*T(n,k)/n! is the coefficient of x^(2*n+1) in the Taylor expansion of the k-th iteration of sin(x).at n=33A366834
• Expansion of e.g.f. exp(sinh(x)) - exp(cosh(x) - 1).at n=11A372508
• Difference between larger and smaller term of n-th psi-amicable pair, sorted by the smaller members from A323329.at n=44A387643