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.

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

This page as a plain text file.
%I A175444 #4 Sep 26 2012 12:08:02
%S A175444 2,5,23,47,79,89,107,131,149,173,191,229,233,257,317,383,401,439,443,
%T A175444 467,499,509,541,593,653,677,709,719,751,761,821,859,863,887,919,929,
%U A175444 947,971,1031,1069,1087,1097,1129,1153,1171,1181,1213,1223,1283,1307
%N A175444 a(n)>a(n-1), a(n) = smallest prime such that a(n)+a(n-1) is multiple of m, a(1)=2, m=7.
%H A175444 Harvey P. Dale, <a href="/A175444/b175444.txt">Table of n, a(n) for n = 1..1000</a>
%t A175444 nxt[n_]:=Module[{sp=NextPrime[n]},While[!Divisible[n+sp,7],sp = NextPrime[ sp]]; sp]; NestList[nxt,2,50] (* _Harvey P. Dale_, Sep 26 2012 *)
%Y A175444 Cf. A175451.
%K A175444 nonn
%O A175444 1,1
%A A175444 _Zak Seidov_, May 28 2010