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 A037040 #12 Sep 06 2024 12:31:04 %S A037040 0,1,4,10,19,31,46,65,84,109,136,166,199,236,275,319,364,413,466,521, %T A037040 578,642,707,776,844,923,996,1079,1168,1254,1342,1436,1535,1636,1740, %U A037040 1846,1960,2074,2186,2310,2434,2559,2690,2825,2961,3103,3248,3392,3542 %N A037040 Number of odd nonprimes < (2n+1)^2. %D A037040 C. R. Christofferson, Unpublished notes, 15219 Wickmere, Houston, TX 77062, (281) 486-4139. %H A037040 Amiram Eldar, <a href="/A037040/b037040.txt">Table of n, a(n) for n = 0..10000</a> %F A037040 a(n) = A038377(n) - 1. %e A037040 The odd nonprimes < 25 are 1, 9, 15 and 21, so a(2) = 4. %t A037040 a[n_] := 2*n^2 + 2*n + 1 - PrimePi[(2*n + 1)^2]; a[0] = 0; Array[a, 61, 0] (* _Amiram Eldar_, Sep 06 2024 *) %o A037040 (PARI) a(n) = if(n == 0, 0, 2*n^2 + 2*n + 1 - primepi((2*n + 1)^2)); \\ _Amiram Eldar_, Sep 06 2024 %Y A037040 Cf. A038377. %K A037040 nonn %O A037040 0,3 %A A037040 C. R. Christofferson (magpie56(AT)aol.com)