[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Revision History for A105110 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Direct matrix (non-recursive) content of -n to n+1 symmetry matrices.
(history; published version)
#4 by Charles R Greathouse IV at Wed Mar 12 16:36:46 EDT 2014
AUTHOR

_Roger L. Bagula_, Apr 07 2005

Discussion
Wed Mar 12
16:36
OEIS Server: https://oeis.org/edit/global/2126
#3 by Russ Cox at Fri Mar 30 18:49:14 EDT 2012
AUTHOR

_Roger Bagula (rlbagulatftn(AT)yahoo.com), _, Apr 07 2005

Discussion
Fri Mar 30
18:49
OEIS Server: https://oeis.org/edit/global/236
#2 by N. J. A. Sloane at Tue Jul 19 03:00:00 EDT 2005
NAME

Direct matrix ( non -recursive) content of -n to n+1 symmetry matrices (corrected).

FORMULA

f(w)=Abs[Det[Table[Table[If [n > m, -q, If[ n == m, 0, q + 1]], {n, 0, w}], {m, 0, w}]]] a(n)=f(w) while q>=w

MATHEMATICA

f[w_] := Abs[Det[Table[Table[If [ n > m, -q, If[ n == m, 0, q + 1]], {n, 0, w}], {m, 0, w}]]] (* triangular table*) a = Table[Table[f[w], {w, 0, q}], {q, 0, 20}] (* output array*) b = Flatten[a]

KEYWORD

nonn,uned,newtabf,obsc

#1 by N. J. A. Sloane at Sat Apr 09 03:00:00 EDT 2005
NAME

Direct matrix ( non -recursive) content of -n to n+1 symmetry matrices (corrected).

DATA

0, 0, 2, 0, 6, 6, 0, 12, 12, 156, 0, 20, 20, 420, 820, 0, 30, 30, 930, 1830, 29730, 0, 42, 42, 1806, 3570, 79422, 229362, 0, 56, 56, 3192, 6328, 185080, 539448, 10903928, 0, 72, 72, 5256, 10440, 388872, 1140552, 29139336, 111259080, 0, 90, 90, 8190, 16290

OFFSET

0,3

COMMENTS

Triangle table: {0} {0, 2} {0, 6, 6} {0, 12, 12, 156} {0, 20, 20, 420, 820} {0, 30, 30, 930, 1830, 29730} {0, 42, 42, 1806, 3570, 79422, 229362}

FORMULA

f(w)=Abs[Det[Table[Table[If [n > m, -q, If[ n == m, 0, q + 1]], {n, 0, w}], {m, 0, w}]]] a(n)=f(w) while q>=w

MATHEMATICA

f[w_] := Abs[Det[Table[Table[If [ n > m, -q, If[ n == m, 0, q + 1]], {n, 0, w}], {m, 0, w}]]] (* triangular table*) a = Table[Table[f[w], {w, 0, q}], {q, 0, 20}] (* output array*) b = Flatten[a]

KEYWORD

nonn,uned,new

AUTHOR

Roger Bagula (rlbagulatftn(AT)yahoo.com), Apr 07 2005

STATUS

approved