cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A299204 a(n) = A000594(n) mod (n-1).

This page as a plain text file.
%I A299204 #17 Feb 07 2018 11:57:18
%S A299204 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,
%T A299204 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,
%U A299204 0,29,2,38,50,28,20,39,26,48,48,0,2,4,2,5,26,35,12
%N A299204 a(n) = A000594(n) mod (n-1).
%H A299204 Seiichi Manyama, <a href="/A299204/b299204.txt">Table of n, a(n) for n = 2..10000</a>
%t A299204 f[n_] := Mod[RamanujanTau@n, n - 1]; Array[f, 76, 2] (* _Robert G. Wilson v_, Feb 07 2018 *)
%o A299204 (PARI) {a(n) = ramanujantau(n)%(n-1)}
%Y A299204 Cf. A000594, A273650, A299163, A299172, A299205.
%K A299204 nonn
%O A299204 2,4
%A A299204 _Seiichi Manyama_, Feb 05 2018