The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A169833 a(n) = 25*2^(n+3) - (198+392*n/3+36*n^2+10*n^3/3). 1
 2, 32, 170, 596, 1690, 4232, 9802, 21580, 45946, 95680, 196362, 399172, 806490, 1623096, 3258570, 6532092, 13082042, 26185200, 52395146, 104819060, 209671322, 419380712, 838804810, 1677658796, 3355373050, 6710808352, 13421686282, 26843450020, 53686985946 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS The formula given in the reference (in Eq. (9)) is wrong. LINKS B. Berselli, Table of n, a(n) for n = 0..1000 [From Bruno Berselli, Jun 04 2010] P. Nissen and J. Taylor, Running clubs - a combinatorial investigation, Math. Mag., 64 (No. 1, 1991), 39-44. Index entries for linear recurrences with constant coefficients, signature (6, -14, 16, -9, 2). FORMULA From Bruno Berselli, Jun 04 2010: (Start) G.f.: 2*(1+10*x+3*x^2-4*x^3)/[(1-2*x)*(1-x)^4] a(n)-6*a(n-1)+14*a(n-2)-16*a(n-3)+9*a(n-4)-2*a(n-5) = 0, with n>4. (End) CROSSREFS Sequence in context: A236550 A012642 A244730 * A228582 A128789 A053316 Adjacent sequences:  A169830 A169831 A169832 * A169834 A169835 A169836 KEYWORD nonn AUTHOR N. J. A. Sloane, Jun 01 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 19 09:35 EST 2020. Contains 331048 sequences. (Running on oeis4.)