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.

A210647 Least nonnegative m such that k(n) + k(m) is prime, where k(n) = n*(n+1)^2/2.

This page as a plain text file.
%I A210647 #23 Oct 13 2013 22:35:55
%S A210647 0,1,22,2,142,1,2,10,22,1,34,10,2,37,46,6,10,1,6,46,46,1,10,106,6,1,
%T A210647 58,2,22,7,2,58,94,3,22,10,2,1,22,2,10,16,6,82,118,4,82,10,18,1,10,2,
%U A210647 22,1,2,10,10,4,22,58,2,19,10,2,46,1,10,70,82,3,22,34
%N A210647 Least nonnegative m such that k(n) + k(m) is prime, where k(n) = n*(n+1)^2/2.
%H A210647 Charles R Greathouse IV, <a href="/A210647/b210647.txt">Table of n, a(n) for n = 1..10000</a>
%t A210647 f[n_] := n (n + 1)^2/2; Table[k = 0; While[! PrimeQ[f[n] + f[k]], k++]; k, {n, 100}] (* _T. D. Noe_, Apr 03 2012 *)
%o A210647 (PARI) a(n)=my(K=n*(n+1)^2/2,m);while(!isprime(K+m*(m+1)^2/2),m++);m \\ _Charles R Greathouse IV_, Aug 03 2012
%Y A210647 Cf. A006002, A129634, A210646.
%K A210647 nonn
%O A210647 1,3
%A A210647 _Gerasimov Sergey_, Mar 27 2012
%E A210647 Corrected by _R. J. Mathar_, Mar 31 2012