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 A126832 #23 Jan 05 2025 01:10:25 %S A126832 1,1,2,3,0,2,1,0,2,0,2,1,2,1,0,1,1,2,0,0,2,2,2,0,0,2,0,3,0,0,2,1,4,1, %T A126832 0,1,1,0,4,0,2,2,2,1,0,2,1,2,3,0,2,1,2,0,0,0,0,0,0,0,2,2,2,3,0,4,1,3, %U A126832 4,0,2,0,2,1,0,0,2,4,0,0,1,2,2,1,0,2,0,0,0,0,2,1,4,1,0,2,1,3,4,0,2,2,2,0,0 %N A126832 Ramanujan numbers (A000594) read mod 5. %D A126832 G. H. Hardy, Ramanujan: twelve lectures on subjects suggested by his life and work, AMS Chelsea Publishing, Providence, Rhode Island, 2002, pp. 166-167. %H A126832 Seiichi Manyama, <a href="/A126832/b126832.txt">Table of n, a(n) for n = 1..10000</a> %H A126832 R. P. Bambah and S. Chowla, <a href="http://dx.doi.org/10.1090/S0002-9904-1947-08913-8">Congruence properties of Ramanujan’s function tau(n)</a>, Bull. Amer. Math. Soc. 53 (1947), 950-955. %H A126832 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 A126832 a(n) = n*sigma(n) mod 5. - _Michel Marcus_, Apr 26 2016. See also the Hardy reference, p. 166, (10.5.2), with a proof. - _Wolfdieter Lang_, Feb 03 2017 %t A126832 Mod[RamanujanTau@ #, 5] & /@ Range@ 105 (* _Michael De Vlieger_, Apr 26 2016 *) %o A126832 (Python) %o A126832 from sympy import divisor_sigma %o A126832 def A126832(n): return n*divisor_sigma(n)%5 # _Chai Wah Wu_, Aug 24 2023 %o A126832 (PARI) a(n) = n*sigma(n) % 5; \\ _Amiram Eldar_, Jan 05 2025 %Y A126832 Cf. A000203, A000594, A064987. %Y A126832 Cf. this sequence (mod 5^1), A126833 (mod 5^2), A126834 (mod 5^3), A126835 (mod 5^4). %K A126832 nonn %O A126832 1,3 %A A126832 _N. J. A. Sloane_, Feb 25 2007