The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A360031 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A360031

a(n) is the number of unlabeled 2-connected graphs with n edges containing at least one pair of nodes with resistance distance 1 when all edges are replaced by unit resistors.
(history; published version)

#6 by Michael De Vlieger at Fri Mar 31 09:17:34 EDT 2023

STATUS

proposed

approved

#5 by Hugo Pfoertner at Fri Mar 31 08:36:17 EDT 2023

STATUS

editing

proposed

#4 by Hugo Pfoertner at Fri Mar 31 08:33:50 EDT 2023

LINKS

Hugo Pfoertner, <a href="/A360031/a360031.pdf">Illustration of terms a(3)-a(7)</a>, 2023.

#3 by Hugo Pfoertner at Tue Mar 14 08:58:50 EDT 2023

DATA

0, 1, 1, 1, 2, 5, 14, 35, 111, 341, 1130, 3969, 15002, 58429, 239045, 1012241

Discussion

Tue Mar 28

14:35

OEIS Server: This sequence has not been edited or commented on for a week
yet is not proposed for review.  If it is ready for review, please
visit https://oeis.org/draft/A360031 and click the button that reads
"These changes are ready for review by an OEIS Editor."

Thanks.
  - The OEIS Server

#2 by Hugo Pfoertner at Sat Mar 11 12:19:24 EST 2023

NAME

allocated for Hugo Pfoertnera(n) is the number of unlabeled 2-connected graphs with n edges containing at least one pair of nodes with resistance distance 1 when all edges are replaced by unit resistors.

DATA

0, 1, 1, 1, 2, 5, 14, 35, 111, 341, 1130, 3969, 15002, 58429

OFFSET

3,5

CROSSREFS

Cf. A010355, A339070, A342558, A360030.

KEYWORD

allocated

nonn,more

AUTHOR

Hugo Pfoertner, Mar 11 2023

STATUS

approved

editing

#1 by Hugo Pfoertner at Sun Jan 22 10:13:05 EST 2023

NAME

allocated for Hugo Pfoertner

KEYWORD

allocated

STATUS

approved