129360

Appears in sequences

• High temperature series for spin-1/2 Ising specific heat on 3-dimensional b.c.c. lattice.at n=3A002917
• Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,17.at n=30A064245
• Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,57.at n=31A065697
• Variance of time for a random walk starting at 0 to reach one of the boundaries at +n or -n for the first time.at n=21A072819
• Nested floor product of n and fractions (k+1)/k for all k>0 (mod 6), divided by 6.at n=19A073363
• Smallest perimeter S such that exactly n distinct Pythagorean triangles with this perimeter can be constructed.at n=33A099830
• A partition product of Stirling_2 type [parameter k = 2] with biggest-part statistic (triangle read by rows).at n=30A157402
• Numbers with prime factorization pqrs^2t^4.at n=9A190384
• Triangle read by rows giving coefficients of Genocchi q-numbers B_n(1,q) (n >= 1) expanded in powers of q.at n=49A193762
• Number of (w,x,y,z) with all terms in {1,...,n} and w<=2x and y>=3z.at n=32A212515
• Composite numbers m such that Sum_{i=1..k} (p_i/(p_i+1)) - Product_{i=1..k} (p_i/(p_i-1)) is an integer, where p_i are the k prime factors of m (with multiplicity).at n=28A230111
• Triangle read by rows: T(n,k) is the number of n-bead bracelets with exactly k different colored beads.at n=42A273891
• Triangle read by rows: T(n,k) is the number of chiral pairs of color loops of length n with exactly k different colors.at n=42A305541
• T(n,k) is the number of non-equivalent distinguishing colorings of the cycle on n vertices with exactly k colors (k>=1). Regular triangle read by rows, n >= 1, 1 <= k <= n.at n=42A309651
• Number of refinement-ordered pairs of strict integer partitions of n.at n=42A317142
• a(1)=2; thereafter a(n) is obtained by applying Eric Angelini's remove-repeated-digits map, x->A320486(x), to n*a(n-1), stopping when 0 is reached.at n=13A321009
• Maximum number of copies of a 1234 permutation pattern in an alternating (or zig-zag) permutation of length n + 5.at n=39A338429
• Number of ways to place k nonattacking anassas on an n X n chess board. Triangle T(n,k) read by rows.at n=33A378561
• Triangular array read by rows: T(n,k) is the number of n-node Stanley graphs containing exactly k connected components, n>=0, 0<=k<=n.at n=49A383656