login
A338512
a(n) is the number of Chvátal-satisfying graphical n-sequences.
1
6, 24, 67, 263, 823, 3276, 10839, 43287, 147943
OFFSET
5,1
LINKS
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. A000569, A004251, A338513 (spurious version).
Sequence in context: A274772 A369177 A234271 * A006528 A052749 A337021
KEYWORD
nonn,more
AUTHOR
Stefano Spezia, Nov 01 2020
STATUS
approved