stroke sequence

[y.kohmoto]

    Hello, seqfans.
    I posted several "foolish" sequences like "Kanji-stroke" sequence to
OEIS.
    From a mathematical point of view, the number of Kanji's stroke means
nothing.

    But if we consider about strokes on some well known graphs like perfect
graph or grid etc, the numbers of these strokes become interesting.
    I considered about number of strokes on perfect di-graphs Kd_n.

    A "stroke" is defined as follows.
    If all di-edges v_i -> v_i+1 , i=0 to m, have same direction, and if no
vertex x exists such that di-edge x -> v_0 has the same direction as v_0 ->
v_1 , and if no vertex y exists such that di-edge v_m+1 -> y has the same
direction as v_m -> v_m+1 , then the di-path v_i -> v_i+1 is called a
"stroke".

    So,  "stroke" means maximal di-path.
    A(n) gives possible maximal numbers of strokes on Kd_n.
    %S A000001 0, 1, 2, 4, 6, 9, 12, 16, 20, 25, 30, 36, 42, ....
    examples :
    n=3 , two strokes are able to exist, "x -> y -> z" and " x -> z" , so
A(3)=2 .
    n=4, maximal four strokes exist, "u -> x -> z" and "u -> y" and "u -> z"
and "x -> y -> z" , so A(4)=4 .

    This sequence is the same as A00
    I would like to ask you about some      .

    o Is my consideration correct?
    o Should I post it to OIES for the comment line of A000000?
    o Is my English readable? If not, tell me a good description of the
definition of stroke.

    Yasutoshi