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!)
A299204 a(n) = A000594(n) mod (n-1). 3
0, 0, 1, 2, 2, 2, 4, 5, 0, 2, 9, 2, 0, 0, 1, 2, 3, 2, 2, 12, 18, 10, 22, 7, 12, 22, 2, 2, 5, 2, 11, 16, 15, 2, 31, 2, 12, 32, 3, 2, 8, 2, 27, 42, 27, 22, 9, 9, 16, 32, 32, 10, 33, 18, 0, 0, 30, 0, 29, 2, 38, 50, 28, 20, 39, 26, 48, 48, 0, 2, 4, 2, 5, 26, 35, 12 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,4
LINKS
MATHEMATICA
f[n_] := Mod[RamanujanTau@n, n - 1]; Array[f, 76, 2] (* Robert G. Wilson v, Feb 07 2018 *)
PROG
(PARI) {a(n) = ramanujantau(n)%(n-1)}
CROSSREFS
Sequence in context: A360360 A089819 A059888 * A230141 A151680 A231351
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Feb 05 2018
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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)