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.

A138691 Numbers of the form 68+p^2 (where p is a prime).

This page as a plain text file.
%I A138691 #11 Jul 08 2014 00:23:16
%S A138691 72,77,93,117,189,237,357,429,597,909,1029,1437,1749,1917,2277,2877,
%T A138691 3549,3789,4557,5109,5397,6309,6957,7989,9477,10269,10677,11517,11949,
%U A138691 12837,16197,17229,18837,19389,22269,22869,24717,26637,27957,29997
%N A138691 Numbers of the form 68+p^2 (where p is a prime).
%C A138691 68 + p^2 is divisible by 3 for any prime p > 3. - _M. F. Hasler_
%H A138691 Harvey P. Dale, <a href="/A138691/b138691.txt">Table of n, a(n) for n = 1..1000</a>
%t A138691 Table[2*34 + Prime[p + 1]^2, {p, 0, 100}]
%t A138691 Prime[Range[50]]^2+68 (* _Harvey P. Dale_, Oct 19 2011 *)
%o A138691 (PARI) forprime(p=1, 1e2, print1(68+p^2, ", ")) \\ _Felix Fröhlich_, Jul 07 2014
%Y A138691 Cf. A138479, A138685, A138686, A138691, A138692, A138693, A138694, A007528, A138696, A138697, A138698, A138699, A138700.
%K A138691 nonn
%O A138691 1,1
%A A138691 _Artur Jasinski_, Mar 26 2008