The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A333397 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A333397

Array read by antidiagonals: T(n,k) is the number of connected k-regular multigraphs on n unlabeled nodes, loops allowed, n >= 0, k >= 0.
(history; published version)

#15 by Alois P. Heinz at Mon Mar 23 21:10:05 EDT 2020

STATUS

editing

approved

#14 by Alois P. Heinz at Mon Mar 23 21:09:54 EDT 2020

NAME

Array read by antidiagonals: T(n,k) is the number of connected k-regular multigraphs on n unlabeled nodes, loops allowed, n >= 1, 0, k >= 0.

STATUS

approved

editing

#13 by OEIS Server at Mon Mar 23 20:46:24 EDT 2020

LINKS

Andrew Howroyd, <a href="/A333397/b333397_1.txt">Table of n, a(n) for n = 0..405</a> (first 28 antidiagonals)

#12 by Alois P. Heinz at Mon Mar 23 20:46:24 EDT 2020

STATUS

proposed

approved

Discussion

Mon Mar 23

20:46

OEIS Server: Installed new b-file as b333397.txt.  Old b-file is now b333397_1.txt.

#11 by Andrew Howroyd at Mon Mar 23 20:21:37 EDT 2020

STATUS

editing

proposed

Discussion

Mon Mar 23

20:46

Alois P. Heinz: yes, thank you!

#10 by Andrew Howroyd at Mon Mar 23 20:20:24 EDT 2020

DATA

1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 2, 1, 0, 0, 1, 0, 2, 0, 1, 0, 0, 1, 1, 3, 4, 5, 1, 0, 0, 1, 0, 3, 0, 10, 0, 1, 0, 0, 1, 1, 4, 9, 26, 28, 17, 1, 0, 0, 1, 0, 4, 0, 47, 0, 97, 0, 1, 0, 0, 1, 1, 5, 17, 91, 291, 639, 359, 71, 1, 0, 0, 1, 0, 5, 0, 149, 0, 2789, 0, 1635, 0, 1, 0, 0, 1, 6, 28, 255, 1934, 12398, 35646, 40264, 8296, 388, 1, 0, 0

OFFSET

1,12

0,18

LINKS

Andrew Howroyd, <a href="/A333397/b333397_1.txt">Table of n, a(n) for n = 10..378405</a> (first 27 28 antidiagonals)

Discussion

Mon Mar 23

20:21

Andrew Howroyd: Also added row 0 on advice.

#9 by Andrew Howroyd at Mon Mar 23 20:00:07 EDT 2020

EXAMPLE

0 | 1 1 1 1 1 1 1 1 1 ...

STATUS

proposed

editing

#8 by Andrew Howroyd at Mon Mar 23 14:07:05 EDT 2020

STATUS

editing

proposed

#7 by Andrew Howroyd at Mon Mar 23 14:04:00 EDT 2020

NAME

Array read by antidiagonals: T(n,k) is the number of connected k-regular multigraphs on n unlabeled nodes, loops allowed, n >= 1, k >= 0.

DATA

1, 0, 1, 1, 0, 1, 1, 0, 2, 0, 1, 0, 0, 1, 2, 3, 1, 1, 0, 3, 0, 5, 0, 2, 0, 1, 0, 0, 1, 3, 7, 8, 7, 1, 4, 5, 1, 0, 4, 0, 20, 0, 11, 3, 0, 10, 0, 1, 0, 0, 1, 4, 13, 32, 56, 31, 15, 1, 9, 26, 28, 17, 1, 0, 5, 0, 66, 0, 187, 4, 0, 47, 0, 22, 97, 0, 1, 0, 0, 1, 5, 22, 101, 384, 727, 654, 140, 30, 1, 17, 91, 291, 639, 359, 71, 1, 0, 6, 0, 181, 0, 3369, 5, 0, 149, 0, 2789, 0, 1635, 0, 2705, 1, 0, 42, 0, 1, 6, 28, 255, 1934, 12398, 35646, 40264, 8296, 388, 1, 0, 0

OFFSET

1,812

LINKS

Andrew Howroyd, <a href="/A333397/b333397.txt">Table of n, a(n) for n = 1..378</a> (first 27 antidiagonals)

STATUS

approved

editing

Discussion

Mon Mar 23

14:07

Andrew Howroyd: This is a mess up on my part - wrong data (the example is correct).

#6 by Susanna Cuyler at Wed Mar 18 16:26:32 EDT 2020

STATUS

proposed

approved