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 A126814 #10 Jan 05 2025 01:05:53 %S A126814 1,8,12,0,14,0,8,0,5,0,4,0,6,0,8,0,2,8,12,0,0,0,8,0,7,0,8,0,6,0,0,0,0, %T A126814 0,0,0,14,0,8,0,10,0,4,0,6,0,0,0,9,8,8,0,14,0,8,0,0,0,4,0,6,0,8,0,4,0, %U A126814 12,0,0,0,8,0,10,0,4,0,0,0,0,0,9,0,12,0,12,0,8,0,10,0,0,0,0,0,8,0,2,8,4,0 %N A126814 Ramanujan numbers (A000594) read mod 16. %H A126814 Amiram Eldar, <a href="/A126814/b126814.txt">Table of n, a(n) for n = 1..10000</a> %H A126814 J. M. Rushforth, <a href="https://doi.org/10.1017/S0305004100027808">Congruence properties of the partition function and associated functions</a>, Mathematical Proceedings of the Cambridge Philosophical Society, Vol. 48, No. 3 (1952), pp. 402-413. %H A126814 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. %F A126814 a(n) == n^3 * sigma(n) (mod 16) (Rushforth, 1952). - _Amiram Eldar_, Jan 04 2025 %t A126814 a[n_] := Mod[RamanujanTau[n], 16]; Array[a, 100] (* _Amiram Eldar_, Jan 04 2025 *) %o A126814 (PARI) a(n) = ramanujantau(n) % 16; \\ _Amiram Eldar_, Jan 04 2025 %Y A126814 Cf. A000203, A000594. %K A126814 nonn %O A126814 1,2 %A A126814 _N. J. A. Sloane_, Feb 25 2007