|
Search: id:A005711
|
|
|
| A005711 |
|
a(n)=a(n-1)+a(n-9).
(Formerly M0479)
|
|
+0
9
|
|
| 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 15, 19, 24, 30, 37, 45, 54, 64, 76, 91, 110, 134, 164, 201, 246, 300, 364, 440, 531, 641, 775, 939, 1140, 1386, 1686, 2050, 2490, 3021, 3662, 4437, 5376, 6516, 7902, 9588, 11638, 14128, 17149, 20811, 25248
(list; graph; listen)
|
|
|
OFFSET
|
0,9
|
|
|
REFERENCES
|
Problem E3274, Amer. Math. Monthly, 95 (1988), 555.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 382
|
|
MAPLE
|
A005711:=-(1+z**8)/(-1+z+z**9); [S. Plouffe in his 1992 dissertation.]
ZL:=[S, {a = Atom, b = Atom, S = Prod(X, Sequence(Prod(X, b))), X = Sequence(b, card >= 8)}, unlabelled]: seq(combstruct[count](ZL, size=n), n=9..65); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 26 2008
M := Matrix(9, (i, j)-> if j=1 and member(i, [1, 9]) then 1 elif (i=j-1) then 1 else 0 fi); a := n -> (M^(n+1))[1, 1]; seq (a(n), n=0..56); - Alois P. Heinz (heinz(AT)hs-heilbronn.de), Jul 27 2008
|
|
CROSSREFS
|
Cf. A005710.
Sequence in context: A101170 A130224 A017903 this_sequence A059765 A143289 A064807
Adjacent sequences: A005708 A005709 A005710 this_sequence A005712 A005713 A005714
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Mohammad K. Azarian, azarian(AT)evansville.edu
|
|
|
Search completed in 0.002 seconds
|
