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.

A344830 a(n) is the smallest b > 1 such that prime(n), prime(n+1), prime(n+2), prime(n+3), prime(n+4) and prime(n+5) are all base-b Wieferich primes.

This page as a plain text file.
%I A344830 #13 Oct 11 2023 08:14:25
%S A344830 132857,2006776,296449,17134811,36763941,34998229,31239565,968576295,
%T A344830 1027038511,287811239,15022368222,33452659960,19477999997,
%U A344830 132892045949,47341045210,32176849766,106967760951,303459122992,20216391690,1411108384416,219517083156,361244580521,455588981749
%N A344830 a(n) is the smallest b > 1 such that prime(n), prime(n+1), prime(n+2), prime(n+3), prime(n+4) and prime(n+5) are all base-b Wieferich primes.
%H A344830 Max Alekseyev, <a href="/A344830/b344830.txt">Table of n, a(n) for n = 1..100</a>
%o A344830 (PARI) a(n) = my(v=[prime(n)]); while(#v < 6, v=concat(v, nextprime(v[#v]+1))); for(b=2, oo, for(k=1, #v, if(Mod(b, v[k]^2)^(v[k]-1)!=1, break, if(k==#v, return(b)))))
%Y A344830 Cf. A039678, A259075. Column 6 of A286816.
%Y A344830 Cf. smallest b > 1 such that prime(n+i) is a base-b Wieferich prime for each i = 0..k: A039678 (k=0), A259075 (k=1), A344827 (k=2), A344828 (k=3), A344829 (k=4), A344831 (k=6), A344832 (k=7).
%K A344830 nonn
%O A344830 1,1
%A A344830 _Felix Fröhlich_, May 29 2021
%E A344830 Terms a(10) onward from _Max Alekseyev_, Oct 10 2023