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.

A067265 Numbers n such that prime(n+1) - prime(n) = M(n) where M(n) is the Mertens function A002321(n).

This page as a plain text file.
%I A067265 #11 Mar 18 2017 19:18:47
%S A067265 1,226,336,395,398,552,554,583,588,805,872,926,957,961,984,995,1008,
%T A067265 1263,1275,1363,1384,1443,1447,1450,1456,1462,1946,1949,1957,1964,
%U A067265 1988,1991,1992,1997,2008,2023,2028,2037,2055,2076,2107,2175,2203,2234,2240
%N A067265 Numbers n such that prime(n+1) - prime(n) = M(n) where M(n) is the Mertens function A002321(n).
%H A067265 Harvey P. Dale, <a href="/A067265/b067265.txt">Table of n, a(n) for n = 1..1000</a>
%t A067265 PrimePi/@With[{nn=2500},Transpose[Select[Thread[{Partition[Prime[ Range[ nn+1]],2,1], Accumulate[Array[MoebiusMu,nn]]}]/.{{a_,b_},c_}-> {a,b,c}, #[[2]]-#[[1]]==#[[3]]&]][[1]]] (* _Harvey P. Dale_, Nov 23 2011 *)
%K A067265 easy,nonn
%O A067265 1,2
%A A067265 _Benoit Cloitre_, Feb 21 2002