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 A102656 #23 Dec 06 2024 15:45:20 %S A102656 2,6,8,18,30,32,36,38,42,56,60,62,66,78,80,86,90,92,102,116,120,128, %T A102656 132,146,162,170,182,188,192,198,206,210,212,216,218,230,242,246,248, %U A102656 260,266,270,276,288,290,296,300,302,308,312,318,330,336,338,350,356,366 %N A102656 Numbers k such that 11*k + 1 is prime. %H A102656 Robert Israel, <a href="/A102656/b102656.txt">Table of n, a(n) for n = 1..10000</a> %F A102656 a(n) = (A141849(n) -1)/11 = 2*A215667(n). - _Robert Israel_, Apr 03 2019 %e A102656 At n=2, 11*2 + 1 = 23 (prime). %e A102656 At n=60, 11*60 + 1 = 661 (prime). %e A102656 At n=120, 11*120 + 1 = 1321 (prime). %p A102656 select(t -> isprime(11*t+1), [seq(i,i=2..1000,2)]); # _Robert Israel_, Apr 03 2019 %t A102656 Select[ Range[2, 367, 2], PrimeQ[11# + 1] &] (* _Robert G. Wilson v_, Feb 04 2005 *) %o A102656 (PARI) is(n)=isprime(11*n+1) \\ _Charles R Greathouse IV_, Jun 06 2017 %o A102656 (Magma) [n: n in [1..380] | IsPrime(11*n+1)]; // _G. C. Greubel_, Apr 03 2019 %o A102656 (Sage) [n for n in (1..380) if is_prime(11*n+1)] # _G. C. Greubel_, Apr 03 2019 %o A102656 (GAP) Filtered([1..380], n-> IsPrime(11*n+1)); # _G. C. Greubel_, Apr 03 2019 %Y A102656 Cf. A141849, A215667. %K A102656 nonn %O A102656 1,1 %A A102656 _Parthasarathy Nambi_, Feb 02 2005 %E A102656 More terms from _Robert G. Wilson v_, Feb 04 2005