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 A131210 #21 Mar 28 2024 09:03:28 %S A131210 1,2,3,7,8,10,11,13,15,16,18,20,21,25,27,30,31,35,36,37,38,41,43,46, %T A131210 48,51,55,57,60,62,63,65,66,67,76,77,78,85,86,87,88,92,98,100,101,102, %U A131210 106,108,111,112,113,120,121,122,125,126,130,132,133,140,142,147,151,153 %N A131210 Numbers k such that 24k - 1 is prime. %C A131210 The complement is 4, 5, 6, 9, 12, 14, 17, 19, 22, 23, 24, ... and contains numbers of the form == 4 (mod 5), == 5 (mod 7), == 6 (mod 11), == 6 (mod 13), == 5 (mod 17) etc., so the complement is a superset of A182719. - _R. J. Mathar_, Jun 10 2020 %H A131210 Muniru A Asiru, <a href="/A131210/b131210.txt">Table of n, a(n) for n = 1..5000</a> %p A131210 select(n->isprime(24*n-1),[$1..160]); # _Muniru A Asiru_, Feb 19 2018 %t A131210 Select[Range[150], PrimeQ[24*# - 1] &] (* _Amiram Eldar_, Mar 28 2024 *) %o A131210 (Magma) [n: n in [0..500]|IsPrime(24*n-1)] // _Vincenzo Librandi_, Nov 23 2010 %o A131210 (PARI) is(n)=isprime(24*n-1) \\ _Charles R Greathouse IV_, Jun 06 2017 %o A131210 (GAP) Filtered([1..160],n->IsPrime(24*n-1)); # _Muniru A Asiru_, Feb 19 2018 %Y A131210 Cf. A182719. %K A131210 nonn,easy %O A131210 1,2 %A A131210 _Zak Seidov_, Oct 29 2007