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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A170933 a(n) = A000930(n) + A000930(n+3) + 4. 1
 7, 8, 9, 12, 16, 21, 29, 41, 58, 83, 120, 174, 253, 369, 539, 788, 1153, 1688, 2472, 3621, 5305, 7773, 11390, 16691, 24460, 35846, 52533, 76989, 112831, 165360, 242345, 355172, 520528, 762869, 1118037 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS G. C. Greubel, Table of n, a(n) for n = 0..1000 Z. Skupien, Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamiltonian cycles, Discr. Math., 309 (2009), 6382-6390. Index entries for linear recurrences with constant coefficients, signature (2,-1,1,-1). FORMULA G.f.: (7-6*x-5*x^3)/(1-2*x+x^2-x^3+x^4). - Colin Barker, Dec 30 2011 a(n) = a(n-1) + a(n-3) - 4 for n>2. - Greg Dresden, Feb 09 2020 MATHEMATICA CoefficientList[Series[(7 - 6*x - 5*x^3)/(1 - 2*x + x^2 - x^3 + x^4), {x, 0, 50}], x] (* G. C. Greubel, Apr 26 2017 *) PROG (PARI) x='x+O('x^50); Vec((7 - 6*x - 5*x^3)/(1 - 2*x + x^2 - x^3 + x^4)) \\ G. C. Greubel, Apr 26 2017 CROSSREFS Sequence in context: A074328 A174185 A309152 * A297257 A296698 A297131 Adjacent sequences:  A170930 A170931 A170932 * A170934 A170935 A170936 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, Feb 10 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 July 30 18:16 EDT 2021. Contains 346359 sequences. (Running on oeis4.)