The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A005488 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A005488

Maximal number of edges in a b^{hat} graceful graph with n nodes.
(history; published version)

#24 by Michel Marcus at Thu May 05 08:08:41 EDT 2022

STATUS

reviewed

approved

#23 by Joerg Arndt at Thu May 05 05:06:28 EDT 2022

STATUS

proposed

reviewed

Discussion

Thu May 05

08:08

Michel Marcus: no worries

#22 by Michel Marcus at Wed May 04 11:53:00 EDT 2022

STATUS

editing

proposed

Discussion

Wed May 04

11:57

J. Stauduhar: Sorry.  I copied from an entry by N.J.A. Sloan.

#21 by Michel Marcus at Wed May 04 11:52:45 EDT 2022

EXTENSIONS

a(9)added by _ from _J. Stauduhar_, May 04 2022

STATUS

proposed

editing

Discussion

Wed May 04

11:53

Michel Marcus: from : like edit screen suggestion

#20 by J. Stauduhar at Wed May 04 11:51:25 EDT 2022

STATUS

editing

proposed

#19 by J. Stauduhar at Wed May 04 11:30:38 EDT 2022

DATA

0, 1, 3, 6, 9, 13, 18, 24, 29

EXTENSIONS

a(9)added by J. Stauduhar, May 04 2022

STATUS

approved

editing

Discussion

Wed May 04

11:51

J. Stauduhar: I searched all C(45,8)=215553195 possible solutions and found 22 of them with a maximal of 29.  One solution is [0, 16, 17, 20, 23, 29, 34, 42, 44], and 44 is the largest number in any solution set.

#18 by Bruno Berselli at Wed Oct 02 05:17:33 EDT 2019

STATUS

proposed

approved

#17 by Michel Marcus at Wed Oct 02 05:02:11 EDT 2019

STATUS

editing

proposed

#16 by Michel Marcus at Wed Oct 02 05:02:07 EDT 2019

COMMENTS

Miller's paper gives these lower bounds for the 11 terms from a(9) to a(19): 29,37,45,51,61,70,79,93,101,113,127. (Bermond's paper gives these as exact values, but quotes Miller as their source.)

REFERENCES

J. Leech, On the representation of $1,2,\cdots,n$ by differences. J. London Math. Soc. 31 (1956), 160-169.

LINKS

J. Leech, <a href="https://doi.org/10.1112/jlms/s1-31.2.160">On the representation of 1, 2, ..., n by differences</a>, J. Lond. Math. Soc. 31 (1956), 160-169.

KEYWORD

nonn,more

EXTENSIONS

Miller's paper gives these lower bounds for the 11 terms from a(9) to a(19): 29,37,45,51,61,70,79,93,101,113,127. (Bermond's paper gives these as exact values, but quotes Miller as their source.)

STATUS

approved

editing

#15 by N. J. A. Sloane at Tue Jun 24 01:08:09 EDT 2014

EXTENSIONS

Edited by _Dean Hickerson (dean.hickerson(AT)yahoo.com), _, Jan 26 2003

Discussion

Tue Jun 24

01:08

OEIS Server: https://oeis.org/edit/global/2238