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 A366491 #29 Nov 15 2023 11:25:54 %S A366491 0,0,27594,61171656,14467258260,1003867701480,32071565263710, %T A366491 599941851861744,7585009898729256,71097458824894320, %U A366491 526315789473684210,3218899497284976120,16814736808980154044,76943173177655058456,314542313628890231430,1166756747396368729440,3976729669784964390480,12582759772902701307744,37275544492386193492506,104127350297911241532840,275941052631578947368420 %N A366491 a(n) = (n^19 - n)/19. %C A366491 See A366488 for further information. %H A366491 Stefano Spezia, <a href="/A366491/b366491.txt">Table of n, a(n) for n = 0..10000</a> %H A366491 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 A366491 <a href="/index/Rec#order_20">Index entries for linear recurrences with constant coefficients</a>, signature (20, -190, 1140, -4845, 15504, -38760, 77520, -125970, 167960, -184756, 167960, -125970, 77520, -38760, 15504, -4845, 1140, -190, 20, -1). %F A366491 a(n) = 0 (mod 42), with 42 = A110936(primepi(19)). - _Hugo Pfoertner_, Nov 14 2023 %t A366491 A366491[n_]:=(n^19-n)/19;Array[A366491,30,0] (* _Paolo Xausa_, Nov 15 2023 *) %Y A366491 Cf. A000217, A007290, A110936, A208536, A208537, A366488, A366489, A366490. %K A366491 nonn,easy %O A366491 0,3 %A A366491 _N. J. A. Sloane_, Nov 13 2023