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.

A214756 a(n) = largest Ramanujan prime R_k in A104272 that is <= A002386(n).

This page as a plain text file.
%I A214756 #36 Jul 14 2016 08:39:52
%S A214756 2,2,2,17,71,107,503,881,1103,1301,9521,15671,19543,31387,155849,
%T A214756 360289,370061,492067,1349147,1356869,2010553,4652239,17051297,
%U A214756 20831119,47326519,122164649,189695483,191912659
%N A214756 a(n) = largest Ramanujan prime R_k in A104272 that is <= A002386(n).
%C A214756 While many values in A214757(n) are equal to A000101(n), here it seems the only value such that A002386(n) is equal to a(n) is a(1) = R_k = A002386(1) = 2.
%C A214756 See "Let rho(m) = A179196(m)" comment at A001223.
%H A214756 Dana Jacobsen, <a href="/A214756/b214756.txt">Table of n, a(n) for n = 1..59</a>
%e A214756 A104272(94) = 1301 < 1327 = A002386(10), so a(10) = 1301.
%o A214756 (Perl) use ntheory ":all";  sub a_from_2386 { my $n = shift; $n = prev_prime($n) while !is_ramanujan_prime($n); $n } # _Dana Jacobsen_, Jul 13 2016
%o A214756 (Perl) perl -Mntheory=:all -nE 'my $n=$1 if /(\d+)$/; $r=ramanujan_primes($n>1e6 ? $n-1e6 : 2, $n); say ++$x," ",$r->[-1];' b002386.txt # _Dana Jacobsen_, Jul 13 2016
%Y A214756 Cf. A002386, A104272, A001223.
%Y A214756 Cf. A214925, A214926, A214757, A214924.
%K A214756 nonn
%O A214756 1,1
%A A214756 _John W. Nicholson_, Jul 27 2012
%E A214756 Edited by _N. J. A. Sloane_, Aug 06 2012
%E A214756 a(16)-a(28) from _Donovan Johnson_, Nov 04 2012