cp's OEIS Frontend

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.

A258035 Smallest prime number p such that p + pssq(1), p + pssq(2), ... p + pssq(n) are all prime but p+pssq(n+1) is not, where pssq(n) is the partial sum of the square of the proper terms of the primorial (A189997(n)-1).

This page as a plain text file.
%I A258035 #20 Jul 09 2015 20:08:57
%S A258035 2,37,3,7,13,277,2617,43,2924263,300999679,631112173,1368737917,
%T A258035 4428230508349
%N A258035 Smallest prime number p such that p + pssq(1), p + pssq(2), ... p + pssq(n) are all prime but p+pssq(n+1) is not, where pssq(n) is the partial sum of the square of the proper terms of the primorial (A189997(n)-1).
%H A258035 Carlos Rivera's Prime Puzzles, <a href="http://www.primepuzzles.net/puzzles/puzz_782.htm">Prime Generating Non-Polynomials</a>
%e A258035 a(3) = 7 because 7 + 4, 7 + 40 and 7 + 940 are primes, but 7 + 45040 = 107 * 421 is not.
%Y A258035 Cf. A257466 (analog for partial primorial sum), A257467 (analog for primorial squared).
%K A258035 hard,more,nonn
%O A258035 0,1
%A A258035 _Fred Schneider_, May 16 2015