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 A126841 #12 Jan 06 2025 04:05:47 %S A126841 1,1307,252,1190,837,607,559,627,823,1208,881,405,1247,1225,626,865, %T A126841 625,213,110,442,1113,152,1286,946,73,685,456,1041,1067,948,194,855, %U A126841 1066,972,702,1085,586,22,128,385,597,1239,269,893,724,1080,932,1027,1229,910,442 %N A126841 Ramanujan numbers (A000594) read mod 11^3. %H A126841 Seiichi Manyama, <a href="/A126841/b126841.txt">Table of n, a(n) for n = 1..10000</a> %H A126841 H. P. F. Swinnerton-Dyer, <a href="http://dx.doi.org/10.1007/978-3-540-37802-0_1">On l-adic representations and congruences for coefficients of modular forms</a>, pp. 1-55 of Modular Functions of One Variable III (Antwerp 1972), Lect. Notes Math., 350, 1973. %t A126841 a[n_] := Mod[RamanujanTau[n], 1331]; Array[a, 100] (* _Amiram Eldar_, Jan 05 2025 *) %o A126841 (PARI) a(n) = ramanujantau(n) % 1331; \\ _Amiram Eldar_, Jan 05 2025 %Y A126841 Cf. A000594, A126839 (mod 11^1), A126840 (mod 11^2), this sequence (mod 11^3). %K A126841 nonn %O A126841 1,2 %A A126841 _N. J. A. Sloane_, Feb 25 2007