login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A278577 Ramanujan function tau(p) as p runs through the prime powers: a(n) = A000594(A000961(n)). 3
1, -24, 252, -1472, 4830, -16744, 84480, -113643, 534612, -577738, 987136, -6905934, 10661420, 18643272, -25499225, -73279080, 128406630, -52843168, -196706304, -182213314, 308120442, -17125708, 2687348496, -1696965207, -1596055698, -5189203740, 6956478662, 2699296768, -15481826884, 9791485272 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Seiichi Manyama, Table of n, a(n) for n = 1..10000 (terms 1..1933 from Daniel Suteu)
D. H. Lehmer, The Vanishing of Ramanujan's Function tau(n), Duke Mathematical Journal, 14 (1947), pp. 429-433.
D. H. Lehmer, The Vanishing of Ramanujan's Function tau(n), Duke Mathematical Journal, 14 (1947), pp. 429-433. [Annotated scanned copy]
PROG
(Python)
from itertools import count, islice
from sympy import primefactors, divisor_sigma
def A278577_gen(): # generator of terms
yield 1
for n in count(2):
f = primefactors(n)
if len(f) == 1:
p, m = f[0], n+1>>1
yield (q:=n**4)*(p*n-1)//(p-1)-24*((0 if n&1 else (m*(35*m - 52*n) + 18*n**2)*(m*divisor_sigma(m))**2)+sum((i*(i*(i*(70*i - 140*n) + 90*n**2) - 20*n**3) + q)*divisor_sigma(i)*divisor_sigma(n-i) for i in range(1, m)))
A278577_list = list(islice(A278577_gen(), 10)) # Chai Wah Wu, Nov 11 2022
CROSSREFS
Sequence in context: A282859 A370110 A000594 * A022716 A181104 A051828
KEYWORD
sign
AUTHOR
N. J. A. Sloane, Nov 29 2016
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 01:36 EDT 2024. Contains 371264 sequences. (Running on oeis4.)