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.

A108511 a(n) is the smallest number m such that prime(m) = n*m - 1, or 0 if no such m exists.

This page as a plain text file.
%I A108511 #11 Aug 09 2021 08:45:56
%S A108511 0,2,1,0,70,182,440,1053,0,6458,0,40087,0,251737,637320,1617173,
%T A108511 4124466,10553445,27067100,69709705,179992910,465769811,0,3140421738,
%U A108511 8179002128,21338685403,0,0,382465573528,0,0,6935812012545,18262325820324,0,0,335276334036937
%N A108511 a(n) is the smallest number m such that prime(m) = n*m - 1, or 0 if no such m exists.
%C A108511 A108512(n) gives number of solutions of the equation prime(x) = n*x - 1.
%e A108511 a(26) = 21338685403 because prime(21338685403) = 26*21338685403 - 1 and 21338685403 is the smallest (only) number m with this property.
%Y A108511 Cf. A108512, A108514.
%K A108511 nonn
%O A108511 1,2
%A A108511 _Farideh Firoozbakht_, Jun 12 2005
%E A108511 a(29)-a(33) from _Donovan Johnson_, Nov 15 2009
%E A108511 a(34)-a(36) from _Jinyuan Wang_, Aug 09 2021