Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003951
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003951 G.f.: (1+x)/(1-8*x). +0
52
1, 9, 72, 576, 4608, 36864, 294912, 2359296, 18874368, 150994944, 1207959552, 9663676416, 77309411328, 618475290624, 4947802324992, 39582418599936, 316659348799488, 2533274790395904, 20266198323167232 (list; graph; listen)
OFFSET

0,2

COMMENT

Coordination sequence for infinite tree with valency 9.

Binomial transform is {1, 10, 91, 820, 7381, ...}, see A002452 . - Philippe DELEHAM (koloyoko(AT)lagoon.nc), Jul 22 2005

LINKS

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 310

Index entries for sequences related to trees

FORMULA

a(n) = Sum_{ 0<=k<=n } A029653(n, k)*x^k for x = 7 . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Jul 10 2005

a(0) = 1; for n>0, a(n) = 9*8^(n-1). [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Dec 05 2009]

EXAMPLE

For n=1, a(1)=9; n=2, a(2)=9*8=72; n=3, a(3)=9*8^2=576 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Dec 05 2009]

MAPLE

k := 9; if n = 0 then 1 else k*(k-1)^(n-1); fi;

CROSSREFS

Sequence in context: A167900 A168686 A168734 this_sequence A168782 A168830 A168878

Adjacent sequences: A003948 A003949 A003950 this_sequence A003952 A003953 A003954

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Dec 04 2009.

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 17 15:31 EDT 2010. Contains 173524 sequences.


AT&T Labs Research