login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
A338512
a(n) is the number of Chvátal-satisfying graphical n-sequences.
1
6, 24, 67, 263, 823, 3276, 10839, 43287, 147943
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
5,1
LINKS
Table of n, a(n) for n=5..13.
Douglas Bauer, Linda Lesniak, Aori Nevo, and Edward Schmeichel,
On the necessity of Chvátal’s Hamiltonian degree condition
, AKCE International Journal of Graphs and Combinatorics. See p. 2.
Vacláv Chvátal,
On Hamilton’s ideals
, J. Combin. Theory Ser. B 12(2): 163-168 (1972).
FORMULA
a(n) = O(4^n/n^3) where O indicates the big O notation (see Ref. 2 in Bauer).
CROSSREFS
Cf.
A000302
,
A000578
.
Cf.
A000569
,
A004251
,
A338513
(spurious version).
Sequence in context:
A274772
A369177
A234271
*
A006528
A052749
A337021
Adjacent sequences:
A338509
A338510
A338511
*
A338513
A338514
A338515
KEYWORD
nonn
,
more
AUTHOR
Stefano Spezia
, Nov 01 2020
STATUS
approved
Lookup
|
Welcome
|
Wiki
|
Register
|
Music
|
Plot 2
|
Demos
|
Index
|
Browse
|
More
|
WebCam
Contribute new seq. or comment
|
Format
|
Style Sheet
|
Transforms
|
Superseeker
|
Recents
The OEIS Community
| Maintained by
The OEIS Foundation Inc.
License Agreements, Terms of Use, Privacy Policy.
.
Last modified April 23 23:26 EDT 2024. Contains 371917 sequences. (Running on oeis4.)