login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A290362 Number of 8-leaf rooted trees with n levels. 2
0, 1, 22, 223, 1344, 5727, 19193, 54046, 133476, 297633, 611644, 1175845, 2138500, 3711279, 6187767, 9965276, 15570232, 23687409, 35193282, 51193771, 73066648, 102508879, 141589173, 192806010, 259151420, 344180785, 452088936, 587792817, 757020988, 966410239 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..1000

B. A. Huberman and T. Hogg, Complexity and adaptation, Evolution, games and learning (Los Alamos, N.M., 1985). Phys. D 22 (1986), no. 1-3, 376-384.

Index entries for linear recurrences with constant coefficients, signature (8,-28,56,-70,56,-28,8,-1).

FORMULA

G.f.: (5*x^5+57*x^4+120*x^3+75*x^2+14*x+1)*x / (x-1)^8.

a(n) = (272*n^7+273*n^6+749*n^5+1365*n^4+1043*n^3+882*n^2+456*n)/7!.

MAPLE

a:= n-> ((((((272*n+273)*n+749)*n+1365)*n+1043)*n+882)*n+456)*n/7!:

seq(a(n), n=0..40);

MATHEMATICA

LinearRecurrence[{8, -28, 56, -70, 56, -28, 8, -1}, {0, 1, 22, 223, 1344, 5727, 19193, 54046}, 30] (* Harvey P. Dale, Oct 16 2017 *)

CROSSREFS

Row n=8 of A290353.

Sequence in context: A224369 A008453 A066573 * A121087 A133719 A008948

Adjacent sequences:  A290359 A290360 A290361 * A290363 A290364 A290365

KEYWORD

nonn,easy

AUTHOR

Alois P. Heinz, Jul 28 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:18 EDT 2019. Contains 322446 sequences. (Running on oeis4.)