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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A197605 Floor( ( n + 1/n )^6 ). 2
 64, 244, 1371, 5892, 19770, 54992, 132810, 287700, 572042, 1061520, 1861242, 3112580, 5000730, 7762992, 11697770, 17174292, 24643050, 34646960, 47833242, 64966020, 86939642, 114792720, 149722890, 193102292, 246493770, 311667792, 390620090, 485590020 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..10000 Index entries for linear recurrences with constant coefficients, signature (7,-21,35,-35,21,-7,1). FORMULA For n > 3, a(n) = n^6 + 6n^4 + 15n^2 + 20. [Charles R Greathouse IV, Dec 27 2011] G.f.: x*(64-204*x+1007*x^2-821*x^3+1017*x^4-455*x^5+125*x^6-15*x^7+3*x^8-x^9)/(1-x)^7. - Vincenzo Librandi, Dec 18 2014 MATHEMATICA Table[Floor[(n + 1/n)^6], {n, 40}] (* T. D. Noe, Dec 27 2011 *) CoefficientList[Series[(64 - 204 x + 1007 x^2 - 821 x^3 + 1017 x^4 - 455 x^5 + 125 x^6 - 15 x^7 + 3 x^8 - x^9) / (1 - x)^7, {x, 0, 40}], x] (* Vincenzo Librandi, Dec 18 2014 *) PROG (Magma) [Floor((n+1/n)^6): n in [1..40]] (PARI) a(n)=if(n>3, n^6+6*n^4+15*n^2+20, [64, 244, 1371][n]) \\ Charles R Greathouse IV, Dec 27 2011 CROSSREFS Cf. A014052, A197602, A197603, A197604. Sequence in context: A223332 A340696 A333428 * A198071 A218902 A197905 Adjacent sequences: A197602 A197603 A197604 * A197606 A197607 A197608 KEYWORD nonn,easy AUTHOR Vincenzo Librandi, Oct 18 2011 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.

Last modified April 14 18:28 EDT 2024. Contains 371667 sequences. (Running on oeis4.)