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.

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

This page as a plain text file.
%I A175446 #7 Aug 31 2024 11:37:27
%S A175446 2,31,79,97,101,163,167,229,233,251,277,317,409,449,541,647,673,691,
%T A175446 739,757,761,823,827,911,937,977,1069,1087,1091,1109,1201,1307,1399,
%U A175446 1439,1487,1549,1553,1571,1597,1637,1663,1747,1861,1879,1949,2011,2081,2099
%N A175446 a(n)>a(n-1), a(n) = smallest prime such that a(n)+a(n-1) is multiple of m, a(1)=2, m=11.
%H A175446 Harvey P. Dale, <a href="/A175446/b175446.txt">Table of n, a(n) for n = 1..1000</a>
%t A175446 sp11[a_]:=Module[{k=NextPrime[a]},While[Mod[a+k,11]!=0,k=NextPrime[k]];k]; NestList[ sp11,2,50] (* _Harvey P. Dale_, Aug 31 2024 *)
%Y A175446 Cf. A175451.
%K A175446 nonn
%O A175446 1,1
%A A175446 _Zak Seidov_, May 28 2010