Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A152946
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A152946 Magic deficiency of the complete graph K_n on n vertices. +0
1
0, 0, 0, 1, 0, 0, 4, 10, 19, 31, 44 (list; graph; listen)
OFFSET

1,7

REFERENCES

A. Kotzig and A. Rosa. Magic Valuations of Finite Graphs. Canad. Math. Bull. v.13 (1970), pp.451-461.

J. P. McSorley and J. A. Trono. On k-minimum and m-minimum Edge-Magic Injections of Graphs. Preprint, (2008).

W. D. Wallis. Magic Graphs. Birkhauser, (2001). Section 2.10.

EXAMPLE

a(4)=1 because when forming an edge-magic injection of K_4 we must use at

least the first 10 natural numbers {1,2,...,10} since K_4 has a total of

10 vertices and edges. However this is not possible. But there is an

edge-magic injection of K_4 using the set {1,2,...,11}\{4}, with largest label 11.

Hence the magic deficiency of K_4 is a(4)=11-10=1.

CROSSREFS

See sequence A152682. The n-th term of the magic defiency sequence equals the

n-th term of sequence A152682 minus "n+{n choose 2}".

(The number "n+{n choose 2}" is the total number of vertices and edges in K_n.)

See also sequence A129413 which concerns the smallest value of the magic sum

of an edge-magic injection of K_n.

Sequence in context: A057312 A008038 A160425 this_sequence A025720 A022793 A005448

Adjacent sequences: A152943 A152944 A152945 this_sequence A152947 A152948 A152949

KEYWORD

nonn

AUTHOR

John P.McSorley (mcsorley60(AT)hotmail.com), Dec 15 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research