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 A046953 #53 Sep 08 2022 08:44:56 %S A046953 6,11,13,16,20,21,24,26,27,31,34,35,36,37,41,46,48,50,51,54,55,56,57, %T A046953 61,62,63,66,68,69,71,73,76,79,81,83,86,88,89,90,91,92,96,97,101,102, %U A046953 104,105,106,111,112,115,116,118,119,121,122,123,125,126,128 %N A046953 Numbers k such that 6*k - 1 is composite. %C A046953 These numbers can be written as 6*x*y + x - y for x > 0, y > 0. - _Ron R Spencer_, Aug 01 2016 %H A046953 Reinhard Zumkeller, <a href="/A046953/b046953.txt">Table of n, a(n) for n = 1..10000</a> %F A046953 a(n) ~ n. - _Charles R Greathouse IV_, Aug 01 2016 %e A046953 a(1)=6 because 6*6 - 1 = 35, which is composite. %p A046953 remove(k-> isprime(6*k-1), [$1..130])[]; # _Muniru A Asiru_, Feb 22 2019 %t A046953 Select[Range[200],!PrimeQ[6#-1]&] (* _Vladimir Joseph Stephan Orlovsky_, Feb 25 2011 *) %o A046953 (Haskell) %o A046953 a046953 n = a046953_list !! (n-1) %o A046953 a046953_list = map (`div` 6) $ %o A046953 filter ((== 0) . a010051' . subtract 1) [6,12..] %o A046953 -- _Reinhard Zumkeller_, Jul 13 2014 %o A046953 (PARI) is(n)=!isprime(6*n-1) \\ _Charles R Greathouse IV_, Aug 01 2016 %o A046953 (Magma) [n: n in [1..200] | not IsPrime(6*n-1)]; // _G. C. Greubel_, Feb 21 2019 %o A046953 (Sage) [n for n in (1..200) if not is_prime(6*n-1)] # _G. C. Greubel_, Feb 21 2019 %o A046953 (GAP) Filtered([1..200], k-> not IsPrime(6*k-1)) # _G. C. Greubel_, Feb 21 2019 %Y A046953 Cf. A046954, A008588, A016969, subsequence of A067611. %Y A046953 Cf. A024898 (complement). %K A046953 nonn %O A046953 1,1 %A A046953 _Felice Russo_