login
This site is supported by donations to The OEIS Foundation.

 

Logo

The submissions stack has been unacceptably high for several months now. Please voluntarily restrict your submissions and please help with the editing. (We don't want to have to impose further limits.)

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126832 Ramanujan numbers (A000594) read mod 5. 0
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, 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, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

REFERENCES

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.

LINKS

Table of n, a(n) for n=1..105.

CROSSREFS

Cf. A000594.

Sequence in context: A059066 A059067 A065861 * A068908 A226192 A113407

Adjacent sequences:  A126829 A126830 A126831 * A126833 A126834 A126835

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Feb 25 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified August 28 13:24 EDT 2015. Contains 261122 sequences.