login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A126842
Ramanujan numbers (A000594) read mod 13.
2
1, 2, 5, 10, 7, 10, 0, 6, 3, 1, 0, 11, 8, 0, 9, 7, 4, 6, 3, 5, 0, 0, 11, 4, 2, 3, 9, 0, 1, 5, 12, 11, 0, 8, 0, 4, 3, 6, 1, 3, 6, 0, 11, 0, 8, 9, 1, 9, 11, 4, 7, 2, 10, 5, 0, 0, 2, 2, 7, 12, 3, 11, 0, 12, 4, 0, 9, 1, 3, 0, 10, 5, 6, 6, 10, 4, 0, 2, 4, 10, 5, 12, 9, 0, 2, 9, 5, 0, 8, 3, 0, 6, 8, 2, 8, 3, 7
OFFSET
1,2
LINKS
H. P. F. Swinnerton-Dyer, On l-adic representations and congruences for coefficients of modular forms, pp. 1-55 of Modular Functions of One Variable III (Antwerp 1972), Lect. Notes Math., 350, 1973.
MATHEMATICA
a[n_] := Mod[RamanujanTau[n], 13]; Array[a, 100] (* Amiram Eldar, Jan 05 2025 *)
PROG
(PARI) a(n) = ramanujantau(n) % 13; \\ Amiram Eldar, Jan 05 2025
CROSSREFS
Cf. A000594.
Sequence in context: A361806 A188525 A324503 * A291933 A332198 A154680
KEYWORD
nonn,changed
AUTHOR
N. J. A. Sloane, Feb 25 2007
STATUS
approved