|
Search: id:A003953
|
|
|
| A003953 |
|
Coordination sequence for infinite tree with valency 11. |
|
+0
7
|
|
| 1, 11, 110, 1100, 11000, 110000, 1100000, 11000000, 110000000, 1100000000, 11000000000, 110000000000, 1100000000000, 11000000000000, 110000000000000, 1100000000000000, 11000000000000000
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
a(n) is sequence A003945(n-1) written in base 2: a(0)= 1, a(n) for n >= 1: 2 times 1, (n-1) times 0. a(n) is also A007283(n-1) and A042950(n) for n >= 1 written in base 2. a(n) is also A098011(n+3) and A101229(n+10) for n >= 1 written in base 2. a(n) is also Abs(A110164(n+1)) for n >= 1 written in base 2. [From Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Aug 17 2009]
|
|
LINKS
|
Index entries for sequences related to trees
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 312
|
|
FORMULA
|
a(n) = Sum_{ 0<=k<=n } A029653(n, k)*x^k for x = 9 . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Jul 10 2005
G.f.: (1+x)/(1-10x). - Paul Barry (pbarry(AT)wit.ie), Mar 22 2006
a(0) = 1, a(n) = 10^n + 10^(n-1) = 11*10^(n-1) for n >= 1. [From Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Aug 17 2009]
|
|
MAPLE
|
k := 11; if n = 0 then 1 else k*(k-1)^(n-1); fi;
|
|
CROSSREFS
|
Sequence in context: A115808 A115806 A115830 this_sequence A101556 A033137 A065829
Adjacent sequences: A003950 A003951 A003952 this_sequence A003954 A003955 A003956
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
