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 A056035 #15 Feb 20 2025 22:09:54 %S A056035 1,115,117,145,229,235,333,338,374,388,414,430,439,440,448,513,521, %T A056035 522,531,547,573,587,623,628,726,732,816,844,846,960,962,1076,1078, %U A056035 1106,1190,1196,1294,1299,1335,1349,1375,1391,1400,1401,1409,1474,1482,1483 %N A056035 Numbers k such that k^30 == 1 (mod 31^2). %H A056035 Amiram Eldar, <a href="/A056035/b056035.txt">Table of n, a(n) for n = 1..10000</a> %H A056035 <a href="/index/Rec#order_31">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,-1). %F A056035 From _Mike Sheppard_, Feb 20 2025 : (Start) %F A056035 a(n) = a(n-1) + a(n-30) - a(n-31). %F A056035 a(n) = a(n-30) + 31^2. %F A056035 a(n) ~ (31^2/30)*n. (End) %t A056035 x=31; Select[ Range[ 2000 ], PowerMod[ #, x-1, x^2 ]==1& ] %Y A056035 Cf. A056021, A056022, A056024, A056025, A056026, A056027, A056028, A056031, A056034. %K A056035 nonn,easy %O A056035 1,2 %A A056035 _Robert G. Wilson v_, Jun 08 2000