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.
%I A197603 #24 Jul 11 2025 18:39:50
%S A197603 16,39,123,326,731,1446,2603,4358,6891,10406,15131,21318,29243,39206,
%T A197603 51531,66566,84683,106278,131771,161606,196251,236198,281963,334086,
%U A197603 393131,459686,534363,617798,710651,813606,927371,1052678,1190283,1340966,1505531,1684806,1879643,2090918,2319531,2566406,2832491,3118758
%N A197603 a(n) = floor((n+1/n)^4).
%H A197603 Vincenzo Librandi, <a href="/A197603/b197603.txt">Table of n, a(n) for n = 1..10000</a>
%H A197603 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (5,-10,10,-5,1).
%F A197603 From _Bruno Berselli_, Oct 17 2011: (Start)
%F A197603 G.f.: x*(16-41*x+88*x^2-59*x^3+21*x^4-x^6)/(1-x)^5.
%F A197603 a(n) = (n^2+2)^2+2 for n>2, a(1)=16, a(2)=39.
%F A197603 a(n) = 5*a(n-1)-10*a(n-2)+10*a(n-3)-5*a(n-4)+a(n-5) for n=6 and n>7.
%F A197603 a(n) = A010000(A010000(n)) for n>2. (End)
%t A197603 Table[Floor[(n+1/n)^4],{n,50}] (* or *) LinearRecurrence[{5,-10,10,-5,1},{16,39,123,326,731,1446,2603},50] (* _Harvey P. Dale_, Jun 03 2015 *)
%o A197603 (Magma) [Floor((n+1/n)^4): n in [1..60]];
%o A197603 (PARI) a(n)=floor((n+1/n)^4) \\ _Charles R Greathouse IV_, Oct 07 2015
%Y A197603 Cf. A010000, A014052.
%K A197603 nonn,easy
%O A197603 1,1
%A A197603 _Vincenzo Librandi_, Oct 17 2011