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 A239968 #29 Jul 31 2025 08:43:37 %S A239968 1,0,0,2,0,3,0,4,5,6,0,7,0,8,9,10,0,11,0,12,13,14,0,15,16,17,18,19,0, %T A239968 20,0,21,22,23,24,25,0,26,27,28,0,29,0,30,31,32,0,33,34,35,36,37,0,38, %U A239968 39,40,41,42,0,43,0,44,45,46,47,48,0,49,50,51,0,52 %N A239968 a(n) = 0 unless n is a nonprime A018252(k) then a(n) = k. %H A239968 Reinhard Zumkeller, <a href="/A239968/b239968.txt">Table of n, a(n) for n = 1..10000</a> %F A239968 a(n) = A066246(n) - A010051(n) + 1. %F A239968 a(n) = A026233(n) - A049084(n); %F A239968 A057427(a(n)) = A005171(n). %F A239968 a(n) = A062298(n)*A005171(n). - _Ridouane Oudra_, Jul 29 2025 %t A239968 Module[{k = 0}, Array[If[!PrimeQ[#], ++k, 0] &, 100]] (* _Paolo Xausa_, Jul 31 2025 *) %o A239968 (Haskell) %o A239968 import Data.List (unfoldr, genericIndex) %o A239968 a239968 n = genericIndex a239968_list (n - 1) %o A239968 a239968_list = unfoldr c (1, 1, a018252_list) where %o A239968 c (i, z, xs'@(x:xs)) | i == x = Just (z, (i + 1, z + 1, xs)) %o A239968 | i /= x = Just (0, (i + 1, z, xs')) %Y A239968 Cf. A005171, A010051, A018252, A057427, A066246, A049084, A026233, A062298. %K A239968 nonn %O A239968 1,4 %A A239968 _Reinhard Zumkeller_, Mar 30 2014