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.

A175442 a(n)>a(n-1), a(n) = smallest prime such that a(n)+a(n-1) is multiple of m, a(1)=2, m=3.

This page as a plain text file.
%I A175442 #5 Nov 21 2013 12:50:01
%S A175442 2,7,11,13,17,19,23,31,41,43,47,61,71,73,83,97,101,103,107,109,113,
%T A175442 127,131,139,149,151,167,181,191,193,197,199,227,229,233,241,251,271,
%U A175442 281,283,293,307,311,313,317,331,347,349,353,367,383,397,401,409,419,421
%N A175442 a(n)>a(n-1), a(n) = smallest prime such that a(n)+a(n-1) is multiple of m, a(1)=2, m=3.
%t A175442 Join[{2},Transpose[Select[Partition[Prime[Range[90]],2,1],Divisible[Total[#],3]&]][[2]]]  (* _Harvey P. Dale_, Feb 20 2011 *)
%Y A175442 Cf. A175451.
%K A175442 nonn
%O A175442 1,1
%A A175442 _Zak Seidov_, May 28 2010