29575

Appears in sequences

• a(n) = (8*n+1)*(8*n+7).at n=21A001533
• Coefficient of x^4 in (1-x-x^2)^(-n).at n=24A006504
• E.g.f.: -arcsin(arcsin(x) - arctanh(x)) (odd powers only).at n=4A013431
• Number of nonempty subsets of {1,2,...,n} in which exactly 2/5 of the elements are <= (n-3)/3.at n=19A048033
• McKay-Thompson series of class 40A for Monster.at n=54A058662
• a(n) = (6*n+1)*(6*n+7).at n=28A085026
• Numbers n that are the hypotenuse of exactly 12 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 12 ways.at n=10A097226
• Numbers n such that phi(n)=2*phi(n-1).at n=27A171271
• Successive integers produced by Conway's PRIMEGAME using Kilminster's Fractran program with only nine fractions.at n=30A183132
• Expansion of Product_{n>=1} (1 - x^(5*n))^24/(1 - x^n)^25 in powers of x.at n=4A278557
• Expansion of Product_{k>=1} (1 - x^(7*k))^24/(1 - x^k)^25 in powers of x.at n=4A282924
• Number of rooted trees with n nodes such that seven equals the maximal number of subtrees of the same size extending from the same node.at n=12A318822
• Number of rooted trees with n nodes such that seven equals the maximal number of isomorphic subtrees extending from the same node.at n=12A318864
• Number of integer partitions of n such that neither the run-lengths nor the negated run-lengths are unimodal.at n=45A332640
• Array read by antidiagonals for k,n>=0: T(n,k) = number of tilings of a 2k X n rectangle using dominos and 2 X 2 right triangles.at n=39A362297
• Number of tilings of a 3 X 2n rectangle using dominos and 2 X 2 right triangles.at n=5A362299
• Irregular triangle read by rows: T(n,k) is the number of partitions of the vertex set of the n-cocktailparty graph into k connected subsets, 1 <= k <= 2*n.at n=23A389985