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 A090680 #8 Aug 18 2025 06:24:06 %S A090680 1,1,1,1,1,2,1,1,2,3,1,3,2,2,2,4,2,4,1,1,3,5,1,1,3,2,2,6,1,7,1,3,4,2, %T A090680 2,9,4,3,3,9,2,9,2,2,5,9,1,1,2,4,3,11,2,2,2,5,7,13,2,12,6,2,2,3,1,13, %U A090680 4,5,3,14,2,13,8,3,3,2,3,15,2,2,8,15,1,3,8,7,2,16,1,3,6,6,10,6,4,19,4,4,4,20,4,19,3,3,10,19,2,18,1,5,1,18,2,3,4,1,10,2,2,2,12,8,6,5,4,23,3,8,3,23,2,4,14 %N A090680 Number of primes p such that n < p < n+A033677(n). %C A090680 Conjecture: no a(n) is zero. Example: n=15: A033677(15) = 5; 2 primes between 15 and 15+5=20 (17 and 19), so a(15) = 2. %Y A090680 Cf. A033677. %K A090680 easy,nonn %O A090680 2,6 %A A090680 _Philippe Deléham_, Dec 18 2003 %E A090680 More terms from _Benoit Cloitre_, Dec 23 2003