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 A158076 #2 Mar 30 2012 17:28:50 %S A158076 1,1,1,1,1,3,4,1,9,4,3,5,7,5,3,10,6,13,10,3,4,30,3,14,8,6,28,6,79,3, %T A158076 21,12,33,22,7,7,37,12,20,31,9,9,110,62,7,38,7,7,21,5,23,6,14,20,3,14, %U A158076 2,86,21,12,13,32,45,85,35,27,55,95,20,6,17,131,19,12,25,55,33,25,101,11,64 %N A158076 Number of primality tests required to generate the n-th term of A083771. %C A158076 The numbers in this sequence are quite low, which suggests that A083771 can be generated quite easily/quickly. It would be interesting to generate further terms to see whether their slow growth continues. %e A158076 The first 5 terms of A083771 are the first 5 primes, so they all require a single primality test, hence the first 5 terms of this sequence are 1. For the 6th term in A083771 we must test 13, 17 until we finally find that 19 works, hence the 6th term of this sequence is 3. %Y A158076 Cf. A083771, A039726. %K A158076 nonn %O A158076 0,6 %A A158076 _Dmitry Kamenetsky_, Mar 12 2009