OFFSET
0,1
COMMENTS
Number of connected 2-regular (simple) graphs with girth exactly 3.
LINKS
FORMULA
a(n) = [n = 3], where [ ] is the Iverson bracket. - Wesley Ivan Hurt, Dec 13 2013
MAPLE
MATHEMATICA
Table[KroneckerDelta[n, 3], {n, 0, 100}] (* Wesley Ivan Hurt, Dec 13 2013 *)
PROG
(PARI) A185013(n)=n==3 \\ M. F. Hasler, Oct 30 2019
(Python)
def A185013(n): return int(n==3) # Chai Wah Wu, Feb 04 2022
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Jason Kimberley, Oct 11 2011
STATUS
approved