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.
%I A038542 #18 Mar 28 2021 07:02:09
%S A038542 19,29,199,337,421,433,443,463,569,577,593,607,641,757,809,821,887,
%T A038542 1021,1049,1063,1289,1439,1471,1499,1607,1621,1637,1901,1987,1993,
%U A038542 2221,2417,2473,2539,2621,2699,2803,2917,3121,3319,3343,3361,3433
%N A038542 Primes p such that Ramanujan function tau(p) is divisible by 11.
%D A038542 Robert A. Rankin, Ramanujan's tau-function and its generalizations, in: G. E. Andrews et al. (eds.), Ramanujan Revisited, Proceedings of the Centenary Conference, University of Illinois at Urbana-Champaign, June 1-5, 1987, Academic Press, 1988, pp. 245-268.
%H A038542 Amiram Eldar, <a href="/A038542/b038542.txt">Table of n, a(n) for n = 1..10000</a>
%t A038542 Select[Range[3500], PrimeQ[#] && Divisible[RamanujanTau[#], 11] &] (* _Amiram Eldar_, Mar 28 2021 *)
%o A038542 (PARI) lista (nn) = {forprime(p=1, nn, if (taup(p) % 11 == 0, print1(p, ", ")););} \\ (with taup(p) defined in A076847) _Michel Marcus_, Jun 26 2013
%o A038542 (Perl) use ntheory ":all"; forprimes { say unless ramanujan_tau($_) % 11; } 1e4; # _Dana Jacobsen_, Sep 05 2015
%Y A038542 Cf. A038543, A076847.
%K A038542 nonn
%O A038542 1,1
%A A038542 Paolo Dominici (pl.dm(AT)libero.it)