login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A176756 Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=4, k=0 and l=-2. 1
1, 4, 6, 26, 98, 438, 1970, 9294, 44698, 219766, 1096930, 5549614, 28383498, 146538150, 762627954, 3996744862, 21074272538, 111723476502, 595145562242, 3183988894350, 17100312159018, 92164073738118, 498318304290450 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
G.f f: f(z)=(1-sqrt(1-4*z*(a(0)-z*a(0)^2+z*a(1)+(k+l)*z^2/(1-z)+k*z^2/(1-z)^2)))/(2*z) (k=0, l=-2).
Conjecture: (n+1)*a(n) +2*(-3*n+1)*a(n-1) +(-3*n+11)*a(n-2) +2*(14*n-45)*a(n-3) +20*(-n+4)*a(n-4)=0. - R. J. Mathar, Feb 18 2016
EXAMPLE
a(2)=2*1*4-2=6. a(3)=2*1*6+4^2-2=26. a(4)=2*1*26+2*4*6-2=98.
MAPLE
l:=-2: : k := 0 : m:=4:d(0):=1:d(1):=m: for n from 1 to 30 do d(n+1):=sum(d(p)*d(n-p)+k, p=0..n)+l:od : taylor((1-sqrt(1-4*z*(d(0)-z*d(0)^2+z*m+(k+l)*z^2/(1-z)+k*z^2/(1-z)^2)))/(2*z), z=0, 30); seq(d(n), n=0..30);
CROSSREFS
Cf. A176655.
Sequence in context: A370061 A192874 A159557 * A054094 A123873 A193689
KEYWORD
easy,nonn
AUTHOR
Richard Choulet, Apr 25 2010
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 08:13 EDT 2024. Contains 371265 sequences. (Running on oeis4.)