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.

A261150 a(n) = 403185216600637 + (n-1)*2124513401010.

This page as a plain text file.
%I A261150 #23 Sep 08 2022 08:46:13
%S A261150 403185216600637,405309730001647,407434243402657,409558756803667,
%T A261150 411683270204677,413807783605687,415932297006697,418056810407707,
%U A261150 420181323808717,422305837209727,424430350610737,426554864011747,428679377412757,430803890813767,432928404214777
%N A261150 a(n) = 403185216600637 + (n-1)*2124513401010.
%C A261150 The terms n = 1..23 are prime. This is the longest known sequence of 23 primes in arithmetic progression with minimal end known as of August 10, 2015.
%H A261150 Colin Barker, <a href="/A261150/b261150.txt">Table of n, a(n) for n = 1..1000</a>
%H A261150 Jens Kruse Andersen, <a href="http://primerecords.dk/aprecords.htm#ap24">All known AP24 to AP26</a>.
%H A261150 Wikipedia, <a href="https://en.wikipedia.org/wiki/Primes_in_arithmetic_progression#Largest_known_primes_in_AP">Largest known primes in AP</a>.
%H A261150 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A261150 a(n) = 403185216600637 + (n-1)*9523*A002110(9).
%F A261150 G.f.: -x*(401060703199627*x-403185216600637) / (x-1)^2. - _Colin Barker_, Aug 25 2015
%e A261150 a(23) = 403185216600637 + 22*2124513401010 = 449924511422857 is prime.
%t A261150 Table[403185216600637 + (n - 1) 2124513401010, {n, 1, 23}]
%o A261150 (Sage) [403185216600637+(n-1)*2124513401010 for n in (1..20)]
%o A261150 (Magma) [403185216600637+(n-1)*2124513401010: n in [1..20]];
%o A261150 (PARI) Vec(-x*(401060703199627*x-403185216600637)/(x-1)^2 + O(x^40)) \\ _Colin Barker_, Aug 25 2015
%Y A261150 Cf. A005115, A002110, A204189.
%K A261150 nonn,easy
%O A261150 1,1
%A A261150 _Marco RipĂ _, Aug 10 2015