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 A366489 #24 Nov 14 2023 10:00:36 %S A366489 0,0,630,122640,5162220,93900240,1004668770,7453000800,42288908760, %T A366489 195528140640,769230769230,2655593241840,8230246567620,23298085122480, %U A366489 61054982558010,149707312950720,346430740566960,761890617915840,1601766528128550,3234844881712080 %N A366489 a(n) = (n^13 - n)/13. %C A366489 See A366488 for further information. %H A366489 Stefano Spezia, <a href="/A366489/b366489.txt">Table of n, a(n) for n = 0..10000</a> %H A366489 Jack Jeffries, <a href="https://doi.org/10.1090/noti2833">Differentiating by prime numbers</a>, Notices Amer. Math. Soc., 70:11 (2023), 1772-1779. %H A366489 <a href="/index/Rec#order_14">Index entries for linear recurrences with constant coefficients</a>, signature (14,-91,364,-1001,2002,-3003,3432,-3003,2002,-1001,364,-91,14,-1). %F A366489 a(n) == 0 (mod 210). - _Hugo Pfoertner_, Nov 14 2023 %t A366489 A366489[n_]:=(n^13-n)/13; Array[A366489,30,0] (* _Paolo Xausa_, Nov 14 2023 *) %Y A366489 Cf. A000217, A007290, A208536, A208537, A366488, A366490, A366491. %K A366489 nonn,easy %O A366489 0,3 %A A366489 _N. J. A. Sloane_, Nov 13 2023