OFFSET
1,2
COMMENTS
Pseudographs are finite graphs with undirected edges without identity, where parallel edges between the same vertices and loops are allowed.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..10000
Index entries for linear recurrences with constant coefficients, signature (1,1,-1).
FORMULA
Apparently a(n) = A258589(n-2) + 2 for n>= 4, i.e., terms satisfy linear recurrence a(n) = a(n-1) + a(n-2) - a(n-3) for n>=7. - Hugo Pfoertner, Dec 02 2022
From Andrew Howroyd, Nov 23 2025: (Start)
The above observation is correct. See A390167 for an explanation.
a(n) = (26*n + (-1)^n - 45)/4 for n >= 4.
G.f.: x*(1 + 3*x + 4*x^2 + 3*x^3 + x^4 + x^5)/((1 - x)^2*(1 + x)). (End)
MATHEMATICA
LinearRecurrence[{1, 1, -1}, {1, 4, 9, 15, 21, 28}, 60] (* Paolo Xausa, May 17 2026 *)
PROG
(PARI) Vec((1 + 3*x + 4*x^2 + 3*x^3 + x^4 + x^5)/((1 - x)^2*(1 + x)) + O(x^60)) \\ Andrew Howroyd, Nov 23 2025
CROSSREFS
KEYWORD
nonn,easy,changed
AUTHOR
Lars Göttgens, Nov 04 2022
STATUS
approved
