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.

A333541 Records in A333537.

This page as a plain text file.
%I A333541 #22 Jul 09 2025 04:51:56
%S A333541 3,5,7,13,17,19,23,29,31,37,41,43,47,61,67,79,83,101,109,113,137,139,
%T A333541 149,151,157,167,199,211,227,239,257,269,277,283,307,313,317,353,373,
%U A333541 379,389,397,409,433,439,499,503,569,571,593,607,617,631,701,709,727,743,757,769,773
%N A333541 Records in A333537.
%C A333541 For the primes that are not records, see A333542.
%H A333541 David A. Corneth, <a href="/A333541/b333541.txt">Table of n, a(n) for n = 1..71</a>
%H A333541 J. S. Myers, R. Schroeppel, S. R. Shannon, N. J. A. Sloane, and P. Zimmermann, <a href="http://arxiv.org/abs/2004.14000">Three Cousins of Recaman's Sequence</a>, arXiv:2004:14000 [math.NT], April 2020.
%e A333541 For n = 91 as A332558(91) = 12 we have (91 + A332558(91) + 1) = (91 + 12 + 1) | (91 * 92 * ... * (91 + 12)) = (91 * 92 * ... * (91 + A332558(91))). The largest prime factor of 91 + 12 + 1 = 104 is 13. For no m < 91 the largest prime factor of m + A332558(m) + 1 = A332559(m) is at least 13 so 13 is a new record in A333537. - _David A. Corneth_, Apr 21 2020
%Y A333541 Cf. A332558, A333537, A333538, A333542.
%K A333541 nonn
%O A333541 1,1
%A A333541 _N. J. A. Sloane_, Apr 20 2020, using data from _Robert Israel_'s comment in A333538
%E A333541 More terms from _David A. Corneth_, Apr 21 2020