|
Search: id:A055994
|
|
|
| A055994 |
|
A second order recursive sequence. |
|
+0
2
|
|
| 1, 16, 115, 550, 2035, 6292, 17017, 41470, 92950, 194480, 384098, 722228, 1301690, 2261000, 3801710, 6210644, 9887999, 15382400, 23434125, 35027850, 51456405, 74397180, 106002975, 149009250, 206859900, 283853856, 385314996, 517788040
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Partial sums of A034266.0,1,15,99,435,1485,4257,10725,24453,51480,101530,189618,... [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Jun 25 2009]
|
|
REFERENCES
|
A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pps. 194-196.
|
|
FORMULA
|
a(n)=(7n+9)*C(n+8, 8)/9. G.f.(x)=(1+6x)/(1-x)^10.
|
|
MATHEMATICA
|
f[n_]:=7*n+1; s1=s2=s3=s4=s5=s6=s7=s8=0; lst={}; Do[a=f[n]; s1+=a; s2+=s1; s3+=s2; s4+=s3; s5+=s4; s6+=s5; s7+=s6; s8+=s7; AppendTo[lst, s8], {n, 0, 6!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Jun 25 2009]
|
|
CROSSREFS
|
Cf. A034266.
Cf. A093564 ((7, 1) Pascal, column m=9). Partial sums of A034266.
Sequence in context: A081194 A121148 A091031 this_sequence A044348 A044729 A101377
Adjacent sequences: A055991 A055992 A055993 this_sequence A055995 A055996 A055997
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Barry E. Williams, Jun 04 2000
|
|
|
Search completed in 0.002 seconds
|
