1,2

The matrices M(n X n): crossed Pascal matrices:

{{1}}

---

{{1,1},

{1,1}}

---

{{1,0,1},

{0,2,0},

{1,0,1}}

---

{{1,0,0,1},

{0,3,3,0}.

{0,3,3,0},

{1,0,0,1}}

---

{{1,0,0,0,1},

{0,4,0,4.0},

{0,0,6,0,0},

{0,4,0,4.0},

{1,0,0,0,1}}

---

{{1,0,0,0,01},

{0,5,0,0,5.0},

{0,0,10,10,0,0},

{0,0,10,10,0,0},

{0,5,0,0,5.0},

{1,0,0,0,01}}

Row sums: {1, 4, 6, 16, 26, 64, 108, 256, 442, 1024, 1796, ...}.

Fourier-like visualization of the polynomials:

s = Table[ParametricPlot3D[{g[[n]] /. x -> Cos[t], g[[

n]] /. x -> Sin[t], n3}, {t, -Pi, Pi}], {n, 1, 10}];

Show[s, PlotRange -> All]

These are Calabi-Yau type n-fold manifolds as Hodge monomial polynomials.

The K3 Hodge number matrix/ diamond is ( 2+20*x+23*x^2 ): M is

{{1,0,1},

{0,20,0},

{1,0,1}}

That matrix is this M[3] matrix 3X3 with the central 2 multiplied by a constant 10.

This kind of polynomial has been a staple of Calabi-Yau Algebraic Geometry of varieties since the early 90's.

The highest n-fold Hodge diamond matrices that I found in the literature that gave me this idea was: http://arXiv.org/abs/hep-th/9405086 Mirror Symmetry and String Vacua from a Special Class of Fano Varieties Authors: Rolf Schimmrigk (Submitted on 13 May 1994 (v1), last revised 15 May 1994 (this version, v2))

Modular Calabi-Yau threefolds By Christian Meyer: "This book discusses the connection between Calabi-Yau threefolds and modular forms. It presents the general theory and brings together the known results. Hundreds of new examples are given of rigid and non-rigid Calabi-Yau..." http://books.google.com/books?id=3Y6c-kUBzpgC&pg=PA150&lpg=PA150&dq=%22bad+primes%22+meyer&source=web&ots=Xzc5sC-hh-&sig=YcL763w-iDago3Bc94-Ghx882qo&hl=en

Matrices: T(n,m,d)= If[n - m == 0, Binomial[d, n], If[d - n - m == 0, Binomial[d, m], 0]]; T(n,m,d)->Matrix M(d]); Polynomials in two variables: p(x,y,d)=Sum[Sum[M[d][[k, m]]*x^(k - 1)*y^(m - 1), {m, 1, d + 1}], {k, 1, d + 1}]; Sequence is: a(n,m)_out=Coefficients(p(x,1,d)).

{1},

{2, 2},

{2, 2, 2},

{2, 6, 6, 2},

{2, 8, 6, 8, 2},

{2, 10, 20, 20, 10, 2},

{2, 12, 30, 20, 30, 12, 2},

{2, 14, 42, 70, 70, 42, 14, 2},

{2, 16, 56, 112, 70, 112, 56, 16, 2},

{2, 18, 72, 168, 252, 252, 168, 72, 18, 2},

{2, 20, 90, 240, 420, 252, 420, 240, 90, 20, 2}

Clear[T, M, p, a, g] T[n_, m_, d_] := If[n - m == 0, Binomial[d, n], If[d - n - m == 0, Binomial[d, m], 0]]; M[d_] := Table[T[n, m, d], {n, 0, d}, {m, 0, d}]; p[x_, y_, d_] := Sum[Sum[M[d][[k, m]]*x^(k - 1)*y^(m - 1), {m, 1, d + 1}], {k, 1, d + 1}]; g = Table[ExpandAll[p[x, 1, d]], {d, 1, 10}]; a = Join[{{1}}, Table[CoefficientList[p[x, 1, w], x], {w, 1, 10}]]; Flatten[a] Join[{1}, Table[Apply[Plus, CoefficientList[p[x, 1, w], x]], {w, 1, 10}]];

Sequence in context: A008767 A105255 A140818 this_sequence A129381 A139514 A068323

Adjacent sequences: A139810 A139811 A139812 this_sequence A139814 A139815 A139816

nonn,tabl,uned

Roger Bagula and Gary W. Adamsom (rlbagulatftn(AT)yahoo.com), May 23 2008