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.

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

This page as a plain text file.
%I A175447 #4 Sep 24 2016 15:36:39
%S A175447 2,11,41,89,197,271,353,401,431,479,509,557,587,661,691,739,743,947,
%T A175447 977,1051,1237,1259,1289,1493,1523,1571,1601,1753,1783,1831,1861,1987,
%U A175447 2017,2039,2069,2143,2251,2273,2381,2663,2693,2741,2797,2819,2927,3001,3083
%N A175447 a(n)>a(n-1), a(n) = smallest prime such that a(n)+a(n-1) is multiple of m, a(1)=2, m=13.
%H A175447 Harvey P. Dale, <a href="/A175447/b175447.txt">Table of n, a(n) for n = 1..1000</a>
%t A175447 sp[n_]:=Module[{p=NextPrime[n]},While[!Divisible[p+n,13],p= NextPrime[ p]]; p]; NestList[sp,2,50] (* _Harvey P. Dale_, Sep 24 2016 *)
%Y A175447 Cf. A175451.
%K A175447 nonn
%O A175447 1,1
%A A175447 _Zak Seidov_, May 28 2010