24080

Appears in sequences

• Representation degeneracies for Ramond strings.at n=18A005305
• E.g.f.: Expansion of cosh(sinh(x)*log(1+x)).at n=8A009154
• Expansion of e.g.f. sec(tan(x)*arcsin(x)) (only even powers).at n=4A012385
• Expansion of e.g.f. sec(arctan(x)*sin(x)) (only even powers).at n=4A012430
• a(n) = dot_product(1,2,...,n)*(5,6,...,n,1,2,3,4).at n=38A026043
• Intermediate edge b of smallest (measured by the longest edge) primitive Euler bricks (a, b, c, sqrt(a^2 + b^2), sqrt(b^2 + c^2), sqrt(a^2 + c^2) are integers).at n=32A031174
• a(n) = a(n-1) + a(round(2*(n-1)/3)) + a(round((n-1)/3)) with a(1)=1, a(2)=2.at n=38A033500
• Base 7 digits are, in order, the first n terms of the periodic sequence with initial period 1,3,0.at n=5A037600
• Smallest composite which when sum of prime factors is repeatedly subtracted reaches a prime after n iterations.at n=32A053093
• a(n) = 3 + floor((2 + Sum_{j=1..n-1} a(j))/3).at n=31A120150
• a(0)=a(1)=1. a(n) = the multiple of n which is >= a(n-1)+a(n-2) and is < a(n-1)+a(n-2)+n.at n=20A128035
• a(n) = 2*Sum_{k=0..n-1} {[x^k] A(x)^(n-k)} * {[x^(n-k-1)] A(x)^(k+1)/(k+1)} for n>0, with a(0)=1, where g.f. A(x) = Sum_{n>=0} a(n)*x^n.at n=6A211195
• Number of parity preserving permutations of the set {1,2,...,n} with exactly k cycles.at n=59A246117
• Number of length n+4 0..7 arrays with no five consecutive terms having the maximum of any two terms equal to the minimum of the remaining three terms.at n=0A249843
• T(n,k)=Number of length n+4 0..k arrays with no five consecutive terms having the maximum of any two terms equal to the minimum of the remaining three terms.at n=21A249844
• Number of length 1+4 0..n arrays with no five consecutive terms having the maximum of any two terms equal to the minimum of the remaining three terms.at n=6A249845
• Triangle read by rows, T(n,k) = sum(j=0..k-1, S(n+1,j+1)*S(n,k-j)) where S denotes the Stirling cycle numbers A132393, T(0,0)=1, n>=0, 0<=k<=2n.at n=29A254881
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 243", based on the 5-celled von Neumann neighborhood.at n=31A271002
• Numbers n such that (n-1)^3 + (n+1)^3 is a taxi-cab number (A001235).at n=40A272910
• Irregular table read by rows: The number of k-faced polyhedra, where k>=4, created when an n-prism, formed from two n-sided regular polygons joined by n adjacent rectangles, is internally cut by all the planes defined by any three of its vertices.at n=30A338801