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 A366488 #28 Aug 03 2025 16:21:58
%S A366488 0,0,186,16104,381300,4438920,32981550,179756976,780903144,2852823600,
%T A366488 9090909090,25937424600,67546215516,162923672184,368142288150,
%U A366488 786341441760,1599289640400,3115626937056,5842582734474,10590023536200,18618181818180,31843409140200,53119845582846,86619068901264,138334649379000,216744162819600
%N A366488 a(n) = (n^11 - n)/11.
%C A366488 If p is a prime, (n^p-n)/p is an integer by Fermat's Little Theorem. For p = 2, 3, 5, 7, ..., this gives A000217, A007290, A208536, A208537, this sequence, A366489, A366490, A366491.
%H A366488 Stefano Spezia, <a href="/A366488/b366488.txt">Table of n, a(n) for n = 0..10000</a>
%H A366488 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 A366488 <a href="/index/Rec#order_12">Index entries for linear recurrences with constant coefficients</a>, signature (12,-66,220,-495,792,-924,792,-495,220,-66,12,-1).
%F A366488 a(n) == 0 (mod 6). - _Hugo Pfoertner_, Nov 14 2023
%t A366488 A366488[n_]:=(n^11-n)/11;Array[A366488,30,0] (* _Paolo Xausa_, Nov 14 2023 *)
%t A366488 LinearRecurrence[{12,-66,220,-495,792,-924,792,-495,220,-66,12,-1},{0,0,186,16104,381300,4438920,32981550,179756976,780903144,2852823600,9090909090,25937424600},30] (* _Harvey P. Dale_, Aug 03 2025 *)
%Y A366488 Cf. A000217, A007290, A208536, A208537, A366489, A366490, A366491.
%K A366488 nonn,easy
%O A366488 0,3
%A A366488 _N. J. A. Sloane_, Nov 13 2023