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.

Showing 1-1 of 1 results.

A339543 Beginnings of record-length chains of primes under iteration of A339541.

Original entry on oeis.org

1, 2, 1483, 2239, 3023417
Offset: 1

Views

Author

J. M. Bergot and Robert Israel, Dec 08 2020

Keywords

Comments

A number n is in this sequence if the sequence defined by x(k+1) = A339541(k) with x(0)=n has more initial primes than the sequences for smaller n.
No more terms < 10^8.

Examples

			Starting with 1483 we get A339541(1483) = 1511, A339541(1511) = 1531, A339541(1531) = 1541, A339541(1541) = 1552.  This makes 4 initial primes (1483, 1511, 1531, 1541 but not 1552), which is more than we get starting with any number < 1483, so 1483 is in the sequence.
		

Crossrefs

Programs

  • Maple
    sod:= (n.b) -> convert(convert(n,base,b),`+`):
    f:= n -> n + sod(n, sod(n,10)):
    g:= proc(n) option remember;
    if isprime(n) then 1 + procname(f(n))
    else 0
    fi
    end proc:
    R:= 1: vmax:= 0: p:= 1:
    while p < 10^7 do
      p:= nextprime(p);
      v:= g(p);
      if v > vmax then
       R:= R, p; vmax:= v;
      fi
    od:
    R;
Showing 1-1 of 1 results.