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 A366490 #28 Nov 14 2023 16:35:55 %S A366490 0,0,7710,7596480,1010580540,44878791360,995685849690,13684147881600, %T A366490 132458812569720,981010688215680,5882352941176470,29732178147017280, %U A366490 130506535690613940,508847995257725760,1793608631137129170,5795654431511374080,17361641481138401520 %N A366490 a(n) = (n^17 - n)/17. %C A366490 See A366488 for further information. %H A366490 Stefano Spezia, <a href="/A366490/b366490.txt">Table of n, a(n) for n = 0..10000</a> %H A366490 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 A366490 <a href="/index/Rec#order_18">Index entries for linear recurrences with constant coefficients</a>, signature (18,-153,816,-3060,8568,-18564,31824,-43758,48620,-43758,31824,-18564,8568, -3060,816,-153,18,-1). %F A366490 a(n) == 0 (mod 30), with 30 = A110936(primepi(17)). - _Hugo Pfoertner_, Nov 14 2023 %t A366490 A366490[n_]:=(n^17-n)/17;Array[A366490,30,0] (* _Paolo Xausa_, Nov 14 2023 *) %Y A366490 Cf. A000217, A007290, A110936, A208536, A208537, A366488, A366489, A366491. %K A366490 nonn,easy %O A366490 0,3 %A A366490 _N. J. A. Sloane_, Nov 13 2023