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.

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

This page as a plain text file.
%I A175445 #5 Nov 21 2013 12:50:01
%S A175445 2,7,11,43,47,61,83,97,101,151,173,223,227,241,263,277,281,313,317,
%T A175445 331,353,367,389,421,443,457,461,547,569,601,641,673,677,691,821,853,
%U A175445 857,907,911,997,1019,1033,1091,1123,1163,1213,1217,1231,1289,1303,1307
%N A175445 a(n)>a(n-1), a(n) = smallest prime such that a(n)+a(n-1) is multiple of m, a(1)=2, m=9.
%H A175445 Harvey P. Dale, <a href="/A175445/b175445.txt">Table of n, a(n) for n = 1..1000</a>
%t A175445 nxt[n_]:=Module[{c=NextPrime[n]},While[!Divisible[n+c,9],c= NextPrime[ c]];c]; NestList[nxt,2,60] (* _Harvey P. Dale_, Feb 18 2012 *)
%Y A175445 Cf. A175451.
%K A175445 nonn
%O A175445 1,1
%A A175445 _Zak Seidov_, May 28 2010