23616

Appears in sequences

• a(n) = (2*n - 7)*n^2.at n=24A015242
• a(n) = floor((3rd elementary symmetric function of 2,3,...,n+3)/(2+3+...+n+3)).at n=24A024178
• Numbers k such that sigma (x) = k has exactly 12 solutions.at n=26A060676
• Expansion of 1/(1-2*x+2*x^2+2*x^3).at n=16A077945
• Expansion of 1/(1+2*x+2*x^2-2*x^3).at n=16A077991
• Variant of the pay-phone sequence A095236. Here a slot at the end of the row is always preferred over a slot sandwiched immediately between two used slots.at n=11A095912
• Consider the family of multigraphs enriched by the species of derangements. Sequence gives number of those multigraphs with n loops and edges.at n=7A098625
• Numbers that have exactly nine prime factors counted with multiplicity (A046312) whose digit reversal is different and also has 9 prime factors (with multiplicity).at n=2A109029
• Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and vertical height (i.e., number of rows) k (1 <= k <= n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=47A121692
• Number of deco polyominoes of height n and vertical height 3 (i.e., having 3 rows).at n=9A121693
• Triangle T(n,k) = (1-k*(k-1))*A053120(n,k), read by rows, 0<=k<=n.at n=52A137448
• Number of permutations p of order n such that the system of congruences x == i (mod p(i)), i=1..n, is solvable.at n=16A140257
• 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, 0), (-1, 1, -1), (1, -1, 1), (1, 0, 1), (1, 1, -1)}.at n=9A148884
• Numbers with 42 divisors.at n=21A175750
• Numbers of the form p^6*q^2*r where p, q, and r are distinct primes.at n=19A179703
• Number of distinct solutions of sum{i=1..10}(x(2i-1)*x(2i)) = 0 (mod n), with x() in 0..n-1.at n=3A180802
• Array read by antidiagonals: T(m,n) = m * Sum(1<=i<=m) (m+n-2+i)!at n=9A211367
• E.g.f. satisfies: A(x) = x/(1 - tanh(A(x))).at n=5A214225
• G.f.: exp( Sum_{n>=1} A113184(n^2)*x^n/n ), where A113184(n) = difference between sum of odd divisors of n and sum of even divisors of n.at n=16A224340
• Expansion of (elliptic_E / elliptic_K)^(1/2) in powers of q.at n=12A261977