A177184 - OEIS

This site is supported by donations to The OEIS Foundation.

A177184

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)=9, k=-1 and l=-1.

1, 9, 15, 107, 479, 3103, 18031, 117727, 755599, 5064687, 34093263, 234114735, 1620229839, 11340760367, 79951746767, 567945479727, 4058390653647, 29163273207087, 210568996777167, 1527068200329007, 11117641676731087 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`0,2`
	LINKS	`Table of n, a(n) for n=0..20.`
	FORMULA	`G.f f: f(z)=(1-sqrt(1-4z(a(0)-za(0)^2+za(1)+(k+l)z^2/(1-z)+kz^2/(1-z)^2)))/(2*z) (k=-1, l=-1).`
	EXAMPLE	`a(2)=219-2-1=15. a(3)=2115-2+81-1-1=107.`
	MAPLE	`l:=-1: : k := -1 : m:=9: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-4z(d(0)-zd(0)^2+zm+(k+l)z^2/(1-z)+kz^2/(1-z)^2)))/(2z), z=0, 30); seq(d(n), n=0..30);`
	CROSSREFS	`C.f A177183.` `Sequence in context: A029712 A136353 A136354 * A098146 A124274 A075134` `Adjacent sequences: A177181 A177182 A177183 * A177185 A177186 A177187`
	KEYWORD	`easy,nonn`
	AUTHOR	`Richard Choulet, May 04 2010`
	STATUS	`approved`

Content is available under The OEIS End-User License Agreement .

Last modified May 24 04:53 EDT 2013. Contains 225615 sequences.