OFFSET
1,2
COMMENTS
Number of monotone n-weightings of a certain connected bipartite digraph. A monotone n-(vertex) weighting of a digraph D = (V,E) is a function w: V -> {0,1,..,n-1} such that w(v1) <= w(v2) for every arc (v1,v2) from E.
From Hugo Pfoertner, Feb 03 2026: (Start)
16*a(n) is also the sum of mutual Manhattan distances of the 2*n*(n+1)+1=A001844(n) distinct grid points (x_i,y_i) in a square lattice such that |x_i| + |y_i| <= n.
The coordinates of the grid points are provided in the first A001844(n) terms of A010751 and A305258.
n 16*a(n) m=A001844(n)
A193452(m)
1 16 5 16
2 192 13 188
3 1008 25 992
4 3504 41 3446
5 9504 61 9354
6 21840 85 21506
(End)
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..1000
Goran Kilibarda and Vladeta Jovovic, Antichains of Multisets, J. Integer Seq., Vol. 7 (2004), Article 04.1.5.
Index entries for linear recurrences with constant coefficients, signature (6,-15,20,-15,6,-1).
FORMULA
a(n) = n + 10*binomial(n, 2) + 30*binomial(n, 3) + 35*binomial(n, 4) + 14*binomial(n, 5).
a(n) = n*(n+1)*(2*n+1)*(7*n^2 + 7*n + 6)/120.
G.f.: x*(1+6*x+6*x^2+x^3)/(1-x)^6. - Colin Barker, Apr 01 2012
Sum_{n>=1} (-1)^(n+1)/a(n) = 480*Pi/17 - (140*Pi/17)*sech(sqrt(17/7)*Pi/2) - 250/3. - Amiram Eldar, Nov 02 2025
E.g.f.: exp(x)*x*(120 + 600*x + 600*x^2 + 175*x^3 + 14*x^4)/120. - Stefano Spezia, Dec 18 2025
MATHEMATICA
Table[n*(n+1)*(2*n+1)*(7*n^2 + 7*n + 6)/120, {n, 1, 25}] (* G. C. Greubel, Oct 07 2017 *)
PROG
(PARI) for(n=1, 25, print1(n*(n+1)*(2*n+1)*(7*n^2 + 7*n + 6)/120, ", ")) \\ G. C. Greubel, Oct 07 2017
(Magma) [n*(n+1)*(2*n+1)*(7*n^2 + 7*n + 6)/120: n in [1..25]]; // G. C. Greubel, Oct 07 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Goran Kilibarda and Vladeta Jovovic, Jul 01 2003
STATUS
approved
