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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003951 G.f.: (1+x)/(1-8*x). 56
1, 9, 72, 576, 4608, 36864, 294912, 2359296, 18874368, 150994944, 1207959552, 9663676416, 77309411328, 618475290624, 4947802324992, 39582418599936, 316659348799488, 2533274790395904, 20266198323167232, 162129586585337856, 1297036692682702848 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Coordination sequence for infinite tree with valency 9.

Binomial transform is {1, 10, 91, 820, 7381, ...}, see A002452. - Philippe Deléham, Jul 22 2005

For n>=1, a(n) equals the numbers of words of length n-1 on alphabet {0,1,...,8} with no two adjacent letters identical. - Milan Janjic, Jan 31 2015

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 310

Index to divisibility sequences

Index entries for linear recurrences with constant coefficients, signature (8).

Index entries for sequences related to trees

FORMULA

a(n) = Sum_{ 0<=k<=n } A029653(n, k)*x^k for x = 7. - Philippe Deléham, Jul 10 2005

a(0) = 1; for n>0, a(n) = 9*8^(n-1). - Vincenzo Librandi, Nov 18 2010

a(0) = 1, a(1) = 9, a(n) = 8*a(n-1). - Vincenzo Librandi, Dec 10 2012

MAPLE

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

MATHEMATICA

q = 9; Join[{a = 1}, Table[If[n != 0, a = q*a - a, a = q*a], {n, 0, 25}]] (* and *) Join[{1}, 9*8^Range[0, 25]] (* Vladimir Joseph Stephan Orlovsky, Jul 11 2011 *)

CoefficientList[Series[(1 + x)/(1 - 8*x), {x, 0, 40}], x] (* Vincenzo Librandi, Dec 10 2012 *)

PROG

(MAGMA) [1] cat [9*8^(n-1): n in [1..20]]; // Vincenzo Librandi, Dec 11 2012

(PARI) a(n)=if(n, 9*8^n/8, 1) \\ Charles R Greathouse IV, Mar 22 2016

CROSSREFS

Sequence in context: A170594 A170642 A170690 * A252702 A033135 A127053

Adjacent sequences:  A003948 A003949 A003950 * A003952 A003953 A003954

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

EXTENSIONS

Edited by N. J. A. Sloane, Dec 04 2009

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 9 10:32 EST 2016. Contains 278971 sequences.