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”).

A126826
Ramanujan numbers (A000594) read mod 9.
0
1, 3, 0, 4, 6, 0, 5, 6, 0, 0, 3, 0, 8, 6, 0, 7, 0, 0, 2, 6, 0, 0, 6, 0, 7, 6, 0, 2, 3, 0, 8, 0, 0, 0, 3, 0, 2, 6, 0, 0, 6, 0, 5, 3, 0, 0, 3, 0, 3, 3, 0, 5, 0, 0, 0, 3, 0, 0, 6, 0, 5, 6, 0, 1, 3, 0, 8, 0, 0, 0, 0, 0, 2, 6, 0, 8, 6, 0, 5, 6, 0, 0, 3, 0, 0, 6, 0, 0, 0, 0, 4, 6, 0, 0, 3, 0, 5, 0, 0, 1, 3, 0, 8, 3, 0
OFFSET
1,2
LINKS
R. P. Bambah and S. Chowla, A new congruence property of Ramanujan’s function tau(n), Bull. Amer. Math. Soc. 53 (1947), 768-769.
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.
FORMULA
a(n) = n^2*sigma(n) mod 9. - Michel Marcus, Apr 25 2016
MATHEMATICA
Mod[RamanujanTau@ #, 9] &@ Range@ 120 (* Michael De Vlieger, Apr 25 2016 *)
PROG
(PARI) a(n) = n^2*sigma(n) % 9; \\ Michel Marcus, Apr 26 2016
CROSSREFS
Sequence in context: A307383 A111486 A192878 * A231983 A231982 A198575
KEYWORD
nonn,changed
AUTHOR
N. J. A. Sloane, Feb 25 2007
STATUS
approved