The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A125066

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

Number of degeneracies on the sets of n ordinary trees with n vertices. These are the values of the information index, (I^w)_D, in Table 15 of the paper by Elena V. Konstantinova and Maxim V. Vidyuk.
(history; published version)

#2 by Russ Cox at Fri Mar 30 17:25:50 EDT 2012

AUTHOR

_Parthasarathy Nambi (PachaNambi(AT)yahoo.com), _, Jan 09 2007

Discussion

Fri Mar 30

17:25

OEIS Server: https://oeis.org/edit/global/136

#1 by N. J. A. Sloane at Fri Jan 12 03:00:00 EST 2007

NAME

Number of degeneracies on the sets of n ordinary trees with n vertices. These are the values of the information index, (I^w)_D, in Table 15 of the paper by Elena V. Konstantinova and Maxim V. Vidyuk.

DATA

4, 4, 39, 58, 214, 502, 1621, 3958, 12295, 30962, 91967, 245143, 720699

OFFSET

9,1

REFERENCES

Elena V. Konstantinova and Maxim V. Vidyuk, "Discriminating tests of information and topological indices. Animals and trees", J. Chem. Inf. Comput. Sci., (2003), vol. 43, 1860-1871. See Table 15, column 9 on page 1868.

EXAMPLE

If n=9 then the value of the information index, (I^w)_D, is 4.

If n=10 then the value of the information index, (I^w)_D, is 4.

If n=11 then the value of the information index, (I^w)_D, is 39.

If n=12 then the value of the information index, (I^w)_D, is 58.

CROSSREFS

Cf. A121223.

KEYWORD

nonn,new

AUTHOR

Parthasarathy Nambi (PachaNambi(AT)yahoo.com), Jan 09 2007

STATUS

approved