cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A197604 a(n) = floor((n+1/n)^5).

This page as a plain text file.
%I A197604 #26 Mar 19 2023 16:55:03
%S A197604 32,97,411,1386,3802,8917,18593,35409,62785,105101,167816,257592,
%T A197604 382408,551684,776400,1069216,1444592,1918908,2510584,3240200,4130616,
%U A197604 5207092,6497408,8031984,9844000,11969516,14447592,17320408,20633384,24435300,28778416,33718592,39315408,45632284,52736600,60699816,69597592,79509908
%N A197604 a(n) = floor((n+1/n)^5).
%H A197604 Vincenzo Librandi, <a href="/A197604/b197604.txt">Table of n, a(n) for n = 1..10000</a>
%H A197604 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (6,-15,20,-15,6,-1).
%F A197604 From _Bruno Berselli_, Oct 27 2011: (Start)
%F A197604 G.f.: x*(32-95*x+309*x^2-265*x^3+191*x^4-62*x^5+16*x^6-13*x^7+11*x^8-5*x^9+5*x^11-10*x^12+10*x^13-5*x^14+x^15)/(1-x)^6.
%F A197604 a(n) = n*(n^4+5*n^2+10) + A033330(n)  for n>1.
%F A197604 a(n) = A197904(n) - 1  for n>1. (End)
%t A197604 Join[{32,97,411,1386,3802,8917,18593,35409,62785,105101},LinearRecurrence[{6,-15,20,-15,6,-1},{167816,257592,382408,551684,776400,1069216},30]] (* _Harvey P. Dale_, Jan 16 2015 *)
%o A197604 (Magma) [Floor((n+1/n)^5): n in [1..60]]
%o A197604 (PARI) a(n)=floor((n+1/n)^5) \\ _Charles R Greathouse IV_, Oct 27 2011
%Y A197604 Cf. A014052.
%K A197604 nonn,easy
%O A197604 1,1
%A A197604 _Vincenzo Librandi_, Oct 17 2011