login

Revision History for A342940

(Bold, blue-underlined text is an ; faded, red-underlined text is a deletion.)

Showing all changes.
Triangle read by rows: T(n, k) is the Skolem number of the parallelogram graph P_{n, k}, with 1 < k <= n.
(history; published version)
#9 by N. J. A. Sloane at Thu Apr 01 14:56:27 EDT 2021
STATUS

proposed

#8 by Stefano Spezia at Wed Mar 31 15:45:57 EDT 2021
STATUS

editing

#7 by Stefano Spezia at Wed Mar 31 14:38:21 EDT 2021
CROSSREFS

#6 by Stefano Spezia at Wed Mar 31 00:46:16 EDT 2021
COMMENTS

For the definition of Skolem number of a graph, see Definitions 1.4 and 1.5 in Carrigan and Green.

#5 by Stefano Spezia at Tue Mar 30 02:48:42 EDT 2021
COMMENTS

For the definition of Skolem number of a graph, see Definition 1.4 and 1.5 in Carrigan and Green.

LINKS

Braxton Carrigan and Garrett Green, <a href="https://research.library.kutztown.edu/contact/vol2/iss1/2/">Skolem Number of Subgraphs on the Triangular Lattice</a>, Communications on Number Theory and Combinatorial Theory 2 (2021), Article 2 (see Theorem 3.3).

FORMULA

T(n, k) = k*n - 2*k - n + 4. Sum_{k=2..n}

T(n, k) = A229183(n-1).

#4 by Stefano Spezia at Tue Mar 30 02:35:08 EDT 2021
CROSSREFS
#3 by Stefano Spezia at Tue Mar 30 02:34:18 EDT 2021
CROSSREFS
#2 by Stefano Spezia at Tue Mar 30 02:33:22 EDT 2021
NAME

allocated for Stefano Spezia

DATA

OFFSET

COMMENTS

LINKS

FORMULA

EXAMPLE

MATHEMATICA

CROSSREFS

KEYWORD

allocated

AUTHOR

STATUS

approved

#1 by Stefano Spezia at Tue Mar 30 02:10:35 EDT 2021
NAME

KEYWORD

STATUS