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 A094260 #17 Apr 05 2023 15:39:18
%S A094260 1,10,5,136,13,666,25,2080,41,5050,61,10440,85,19306,113,32896,145,
%T A094260 52650,181,80200,221,117370,265,166176,313,228826,365,307720,421,
%U A094260 405450,481,524800,545,668746,613,840456,685,1043290,761,1280800,841,1556730,925,1875016,1013,2239786
%N A094260 Sum of next n numbers/n if n divides the sum else n times the sum of next n numbers.
%C A094260 Quasipolynomial of order 2 and degree 5. - _Charles R Greathouse IV_, Oct 14 2013
%H A094260 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (0,5,0,-10,0,10,0,-5,0,1).
%F A094260 For even n, a(n) = A000217(n^2) = n^2*(n^2+1)/2; for odd n, a(n) = (n^2 + 1)/2.
%F A094260 Sum_{n>=1} 1/a(n) = 1 + Pi^2/12 - Pi*cosech(Pi). - _Amiram Eldar_, Aug 23 2022
%e A094260 The sequence is: 1/1, (2+3)*2, (4+5+6)/3, (7+8+9+10)*4, ...
%t A094260 LinearRecurrence[{0,5,0,-10,0,10,0,-5,0,1},{1,10,5,136,13,666,25,2080,41,5050},50] (* _Harvey P. Dale_, May 01 2020 *)
%t A094260 fix[c_]:=If[Mod[Total[c],Length[c]]==0,Total[c]/Length[c],Length[c] Total[c]]; fix/@With[ {nn=50},TakeList[ Range[(nn(nn+1))/2],Range[nn]]] (* _Harvey P. Dale_, Apr 05 2023 *)
%o A094260 (PARI) a(n) = if (n%2, (n^2+1)/2, n^2*(n^2+1)/2); \\ _Michel Marcus_, Aug 23 2022
%Y A094260 Cf. A000217, A037270, A001844.
%K A094260 nonn,easy
%O A094260 1,2
%A A094260 _Amarnath Murthy_, Apr 26 2004
%E A094260 Edited and extended by _Max Alekseyev_, Apr 26 2009