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.

A299163 a(n) = A000594(n) mod (n+1).

This page as a plain text file.
%I A299163 #17 Jan 09 2025 02:05:50
%S A299163 1,0,0,3,0,0,0,6,7,9,0,11,0,6,8,14,0,1,0,0,2,0,0,10,15,24,0,10,0,18,0,
%T A299163 30,12,21,12,20,30,6,24,4,0,3,16,21,0,15,0,21,43,15,20,21,0,45,0,27,
%U A299163 42,34,0,28,46,42,56,38,48,60,16,0,14,63,0,50,60,36,12
%N A299163 a(n) = A000594(n) mod (n+1).
%H A299163 Seiichi Manyama, <a href="/A299163/b299163.txt">Table of n, a(n) for n = 1..10000</a>
%t A299163 a[n_] := Mod[RamanujanTau[n], n+1]; Array[a, 100] (* _Amiram Eldar_, Jan 09 2025 *)
%o A299163 (PARI) {a(n) = ramanujantau(n)%(n+1)}
%Y A299163 Cf. A000594, A273650, A299157.
%K A299163 nonn
%O A299163 1,4
%A A299163 _Seiichi Manyama_, Feb 04 2018