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!)
A210685 a(1)=-1, a(2)=2, thereafter a(n) = (1/(2n))*((7n-22)a(n-1)+2(2n-1)a(n-2)). 0
-1, 2, -2, 2, -1, 2, 2, 8, 22, 68, 212, 678, 2207, 7298, 24458, 82928, 284066, 981884, 3421316, 12007556, 42416486, 150718772, 538421588, 1932856592, 6969847484, 25237057112, 91729488352, 334589415278, 1224445617887, 4494622119426, 16545704494682, 61071167108960, 225982053183050 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
REFERENCES
Liu Yanpei, On the number of rooted c-nets, J. Combin. Theory, B 36 (1984), 118-123. See the sequence R_n.
LINKS
FORMULA
A000287(n) = (-1)^n*2 + a(n-1).
MAPLE
R:=proc(n) option remember; if n=1 then -1 elif n=2 then 2 else
(1/(2*n))*((7*n-22)*R(n-1)+2*(2*n-1)*R(n-2)); fi; end;
[seq(R(n), n=1..40)];
MATHEMATICA
a[n_] := a[n] = Which[n == 1, -1, n == 2, 2, True, (1/(2*n))*((7*n-22)*a[n-1]+2*(2*n-1)*a[n-2])]; Table[a[n], {n, 1, 40}] (* Jean-François Alcover, Mar 06 2014, after Maple *)
CROSSREFS
Cf. A000287.
Sequence in context: A366693 A147680 A192895 * A264051 A120965 A151931
KEYWORD
sign
AUTHOR
N. J. A. Sloane, Mar 28 2012
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 April 19 16:21 EDT 2024. Contains 371794 sequences. (Running on oeis4.)