

A060408


Triangle T(n,k) in which nth row gives numbers of super edgemagic labelings of (n,k)graphs, for n >= 2, and 1 <= k <= 2n3.


2



1, 3, 2, 1, 6, 6, 6, 4, 2, 10, 14, 20, 24, 24, 16, 8, 15, 26, 48, 80, 120, 144, 144, 96, 48, 21, 44, 99, 212, 420, 720, 1080, 1296, 1296, 864, 432, 28, 68, 180, 464, 1140, 2520, 5040, 8640, 12960, 15552, 15552, 10368, 5184
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

2,2


COMMENTS

(n,k)graphs are simple graphs with n vertices and k edges.
Row indexed n has length 2n3.
The diagonal counting the super edgemagic labelings of (n,n)graphs appears to be A077613(n1).


LINKS

Jason Kimberley, Rows n = 2..101 of triangle
R. M. FigueroaCenteno et al., The place of super edgemagic labelings among other classes of labelings, Discrete Math., 231 (2001), 153168.


EXAMPLE

1; 3,2,1; 6,6,6,4,2; 10,14,20,24,24,16,8; ...


PROG

(MAGMA) A060408 := func< n, k  &+[ Integers()  &*[ Integers()  a[j] : j in [i .. i+k1] ] : i in [3 .. 2*nk] ] where a is [ j lt 3 select 0 else j le n+1 select (j1) div 2 else (2*nj+1) div 2 : j in [1..2*n1] ] >; [[ A060408(n, k): k in [1..2*n3] ]: n in [1..10]];


CROSSREFS

Sequence in context: A114155 A192018 A079513 * A267121 A208518 A139624
Adjacent sequences: A060405 A060406 A060407 * A060409 A060410 A060411


KEYWORD

nonn,tabf,easy


AUTHOR

N. J. A. Sloane, Apr 06 2001


EXTENSIONS

Entry T(3,3)=1 (that was erroneously missing from the table of FigueroaCenteno et al. making the rows appear to be irregular) inserted by, DOI reference provided by, and empirical cross reference for the T(n,n) diagonal observed by Jason Kimberley, Apr 16 2010


STATUS

approved



