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!)
A273650 a(n) = A000594(n) mod n. 7
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 8, 0, 0, 0, 10, 0, 7, 0, 0, 20, 1, 0, 0, 16, 0, 0, 24, 0, 21, 0, 21, 32, 0, 0, 31, 22, 27, 0, 30, 0, 31, 24, 0, 22, 27, 0, 0, 0, 21, 28, 29, 0, 45, 0, 54, 4, 14, 0, 49, 54, 0, 0, 30, 24, 64, 36, 45, 0, 19, 0, 67, 70, 0, 32, 42, 54, 37, 0, 0, 18 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,13

LINKS

Seiichi Manyama, Table of n, a(n) for n = 1..10000

FORMULA

a(n) = A000594(n) mod n.

EXAMPLE

tau(10) mod 10 = (-115920) mod 10 = 0,

tau(11) mod 11 = 534612 mod 11 = 1.

PROG

(PARI) a(n)=ramanujantau(n)%n \\ assumes the GRH; Charles R Greathouse IV, May 27 2016

CROSSREFS

Cf. A000594, A063938.

Sequence in context: A317445 A199619 A036482 * A263014 A028721 A028664

Adjacent sequences:  A273647 A273648 A273649 * A273651 A273652 A273653

KEYWORD

nonn

AUTHOR

Seiichi Manyama, May 27 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 August 19 23:59 EDT 2022. Contains 356231 sequences. (Running on oeis4.)