The first few values of the tau function are given in the following table (sequence A000594 in the OEIS):
n
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
τ(n)
1
−24
252
−1472
4830
−6048
−16744
84480
−113643
−115920
534612
−370944
−577738
401856
1217160
987136
Calculating this function on an odd square number (i.e. a centered octagonal number) yields an odd number, whereas for any other number the function yields an even number.[1]
Ramanujan's conjectures
Ramanujan (1916) observed, but did not prove, the following three properties of τ(n):
The first two properties were proved by Mordell (1917) and the third one, called the Ramanujan conjecture, was proved by Deligne in 1974 as a consequence of his proof of the Weil conjectures (specifically, he deduced it by applying them to a Kuga-Sato variety).
Congruences for the tau function
For k ∈ and n ∈ >0, the Divisor functionσk(n) is the sum of the kth powers of the divisors of n. The tau function satisfies several congruence relations; many of them can be expressed in terms of σk(n). Here are some:[2]
Suppose that f is a weight-k integer newform and the Fourier coefficients a(n) are integers. Consider the problem:
Given that f does not have complex multiplication, do almost all primes p have the property that a(p) ≢ 0 (mod p)?
Indeed, most primes should have this property, and hence they are called ordinary. Despite the big advances by Deligne and Serre on Galois representations, which determine a(n) (mod p) for n coprime to p, it is unclear how to compute a(p) (mod p). The only theorem in this regard is Elkies' famous result for modular elliptic curves, which guarantees that there are infinitely many primes p such that a(p) = 0, which thus are congruent to 0 modulo p. There are no known examples of non-CM f with weight greater than 2 for which a(p) ≢ 0 (mod p) for infinitely many primes p (although it should be true for almost all p). There are also no known examples with a(p) ≡ 0 (mod p) for infinitely many p. Some researchers had begun to doubt whether a(p) ≡ 0 (mod p) for infinitely many p. As evidence, many provided Ramanujan's τ(p) (case of weight 12). The only solutions up to 1010 to the equation τ(p) ≡ 0 (mod p) are 2, 3, 5, 7, 2411, and 7758337633 (sequence A007659 in the OEIS).[11]
Lehmer (1947) conjectured that τ(n) ≠ 0 for all n, an assertion sometimes known as Lehmer's conjecture. Lehmer verified the conjecture for n up to 214928639999 (Apostol 1997, p. 22). The following table summarizes progress on finding successively larger values of N for which this condition holds for all n ≤ N.
Wilton, J. R. (1930), "Congruence properties of Ramanujan's function τ(n)", Proceedings of the London Mathematical Society, 31: 1–10, doi:10.1112/plms/s2-31.1.1