|
Search: id:A135148
|
|
|
| A135148 |
|
A binomial recursion : a(n)=q(n) (see comment). |
|
+0
6
|
|
| 0, 1, 6, 45, 400, 4115, 48146, 631729, 9189972, 146829039, 2556200086, 48167698733, 976792093784, 21211601837803, 491112582793626, 12077021182230057, 314362864408454236, 8635229233659916007
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Let z(1)=x and z(n)=1+sum(k=1,n-1,(2+binomial(n,k))*z(k)), then z(n)=p(n)*x+q(n).
|
|
REFERENCES
|
B. Cloitre, Binomial recursions, Pi and log2, in preparation 2007
|
|
FORMULA
|
Lim n-->infty p(n)/q(n)=(3-2*log(2))/(2*log(2)-1)=4.177398899124179661610768...
|
|
PROGRAM
|
(PARI) r=1; s=2; v=vector(120, j, x); for(n=2, 120, g=r+sum(k=1, n-1, (s+binomial(n, k))*v[k]); v[n]=g); z(n)=v[n]; p(n)=polcoeff(z(n), 1); q(n)=polcoeff(z(n), 0); a(n)=p(n);
|
|
CROSSREFS
|
Cf. A135147, A135149, A135150, A135074, A135075.
Sequence in context: A007194 A025551 A101600 this_sequence A137974 A001879 A019577
Adjacent sequences: A135145 A135146 A135147 this_sequence A135149 A135150 A135151
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 20 2007
|
|
|
Search completed in 0.002 seconds
|
